Depth-first search (DFS) is an algorithm for traversing or searching a tree, tree structure, or graph. One starts at the root (selecting some node as the root in the graph case) and explores as far as possible along each branch before backtracking.

- Wiki
1 articles, 0 books.

Depth-first search is a simple way, to explore a graph.