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:
“We spent them not in toys, in lusts, or wine,
But search of deep Philosophy,
Wit, Eloquence, and Poetry,
Arts which I loved, for they, my Friend, were thine.”
—Abraham Cowley (1618–1667)