Applications of Depth First Search – Graph Algorithms – Depth-first search (DFS) is an algorithm (or technique) for traversing a graph.
depth first search example
2 Articles
2
Cpp Algorithm – Depth First Traversal or DFS for a Graph – Graph Algorithms -Depth First Traversal for a graph is similar to Depth First Traversal of a tree