depth-first search

Computing Dictionary

depth-first search definition

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
Previous Definition: depth-field
Next Definition: depth-focus
Words Near: depth-first search
More from
Synonyms and Antonyms for depth-first search
More from
Search for articles containing depth-first search Word FAQs presents 366 FAQs, incorporating some of the frequently asked questions from the past with newer queries.

Copyright © 2014, LLC. All rights reserved.
  • Please Login or Sign Up to use the Recent Searches feature