depth-first search

(redirected from Depth-first)
Also found in: Wikipedia.

depth-first search

(algorithm)
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.
References in periodicals archive ?
The search amounts to a depth-first traversal of the graph.
The depth-first search just described found the following chain of length 23:
DMAIC Six Sigma may still be used during depth-first plunges into the system architecture analysis and for 'back end' Six Sigma processes; DFSS provides system design processes used in front-end complex system designs.
For structural problems, the classic sequential methods for depth-first searches along undirected graphs were studied and some limitations for their use in networks of workstations were individualized.