Linked from

The 19 pages that link to Depth-first search, each with the reason it gives.

• Breadth-first searchCompared with: It uses a stack-like strategy and does not generally find minimum-edge paths.

• Path (graph theory)Related: Its search tree records paths discovered during exploration.

• Directed acyclic graphRelated: A back edge found during depth-first search reveals a directed cycle.

• Tree (graph theory)Related: Its backtracking structure mirrors the branching paths of a tree.

• BacktrackingRelated: Backtracking commonly uses this traversal pattern to explore one partial solution at a time.

• Connected componentRelated: A traversal from an unvisited vertex marks exactly the vertices in its component.

• Topological sortingRelated: Reversing its finishing order yields a topological sort of a DAG.

• Adjacency listRelated: Its recursive or stack-based exploration follows entries in each adjacency list.

• Connected graphRelated: A single traversal can check whether every vertex is reachable from a chosen start.

• Spanning treeRelated: Its discovery edges form a spanning tree when the graph is connected.

• A* search algorithmCompared with: It uses little frontier memory but offers no A*-like guarantee of a cheapest path.

• Undirected graphRelated: It discovers connected structure by following undirected edges and retreating at dead ends.

• Edmonds–Karp algorithmCompared with: Using it to select paths yields a different Ford–Fulkerson implementation without Edmonds–Karp's shortest-path guarantee.

• Directed cycleRelated: Back edges found during traversal can certify a directed cycle.

• Hamiltonian path problemRelated: It provides a direct search framework for constructing candidate paths.

• Savitch's theoremCompared with: Unlike explicit graph search, the theorem's recursion avoids storing a potentially enormous frontier.

• MazeRelated: Its backtracking pattern mirrors a common way to explore maze corridors.

• Peg solitaireRelated: It can enumerate jump sequences while using little memory.

• Robbins' theoremRelated: A depth-first search tree supports a direct construction of the required orientation.