noun
Meaning 1
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.
Definition source: English Wiktionary via Wiktextract
Usage: countable, uncountable
Topics: graph-theory, mathematics, sciences
No example sentence was provided for this meaning.
Meaning relationships
Synonyms: DFS
Antonyms: none provided