depth-first search

D d

Transcription

- US Pronunciation
- US IPA

- US Pronunciation
- US IPA

Definitions of depth-first search words

noun Technical meaning of 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. 1
noun depth-first search an algorithm for traversing a tree or graph where one starts at the root nad explores as far as possible along each branch before backtracking. 0

See all 2 definitions of depth-first search

Information block about the term

Parts of speech for Depth-first search

noun

adjective

verb

adverb

pronoun

preposition

conjunction

determiner

exclamation

Full grammatical hierarchy of Depth-first search

See also

Matching words

Was this page helpful?

Yes No

Thank you for your feedback! Tell your friends about this page

Tell us why?