depth-first search

English

Noun

depth-first search (countable and uncountable, plural depth-first searches)

1. (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

algorithm where one starts at the root and explores as far as possible down before going up

Finnish: syvyyshaku German: Tiefensuche f Icelandic: lóðleit f, dýptarleit f Polish: przeszukiwanie wgłąb n

Further reading

• depth-first search on Wikipedia.Wikipedia