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.
A version of depth-first search was investigated in the 19th century by French mathematician Charles Pierre Trémaux as a strategy for solving mazes.
Read more about Depth-first Search: Formal Definition, Properties, Example, Output of A Depth-first Search, Pseudocode, Applications
Famous quotes containing the word search:
“You may well ask how I expect to assert my privacy by resorting to the outrageous publicity of being one’s actual self on paper. There’s a possibility of it working if one chooses the terms, to wit: outshouting image-gimmick America through a quietly desperate search for self.”
—Kate Millett (b. 1934)