You are here: irt.org | FOLDOC | 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.

(1995-04-19)

Nearby terms: dependable software « Deployment Descriptor « deprecated « **depth-first search** » deque » dequeue » DER

FOLDOC, Topics, A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, ?, ALL