Try Our Apps


Supposedly vs. Supposably

depth-first search

depth-first search in Technology
A graph search algorithm which extends the current path as far as possible before backtracking to the last choice point and trying the next alternative path. Depth-first search may fail to find a solution if it enters a cycle in the graph. This can be avoided if we never extend a path to a node which it already contains.
Opposite of breadth first search. See also iterative deepening.
The Free On-line Dictionary of Computing, © Denis Howe 2010
Cite This Source

Word of the Day

Word Value for depth

Scrabble Words With Friends

Nearby words for depth-first search