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:
“If ever the search for a tranquil belief should end,
The future might stop emerging out of the past,
Out of what is full of us; yet the search
And the future emerging out of us seem to be one.”
—Wallace Stevens (1879–1955)