depth-first search
English edit
Noun edit
depth-first search (countable and uncountable, plural depth-first searches)
- (graph theory) An algorithm for traversing a tree or graph where one starts at the root and explores as far as possible along each branch before backtracking.
- Synonym: DFS
- Coordinate term: breadth-first search
Translations edit
algorithm where one starts at the root and explores as far as possible down before going up
|
Further reading edit
- depth-first search on Wikipedia.Wikipedia