KnowraDepth-first searchLinked fromLinked fromThe 19 pages that link to Depth-first search, each with the reason it gives.All 19Related 15Compared with 4Breadth-first searchCompared with: It uses a stack-like strategy and does not generally find minimum-edge paths.A* search algorithmCompared with: It uses little frontier memory but offers no A*-like guarantee of a cheapest path.Edmonds–Karp algorithmCompared with: Using it to select paths yields a different Ford–Fulkerson implementation without Edmonds–Karp's shortest-path guarantee.Savitch's theoremCompared with: Unlike explicit graph search, the theorem's recursion avoids storing a potentially enormous frontier.