Definitions from Wiktionary (depth-first search)
▸ noun: (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.
▸ Words similar to depth-first search
▸ Usage examples for depth-first search
▸ Idioms related to depth-first search
▸ Wikipedia articles (New!)
▸ Words that often appear near depth-first search
▸ Rhymes of depth-first search
▸ Invented words related to depth-first search
▸ noun: (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.
Similar:
Dijkstra's algorithm,
dawg,
gradient descent,
directed acyclic word graph,
DFSP,
downscan,
decision stream,
DBSCAN,
depth-psychology,
free-diving,
more...
Phrases:
▸ Words similar to depth-first search
▸ Usage examples for depth-first search
▸ Idioms related to depth-first search
▸ Wikipedia articles (New!)
▸ Words that often appear near depth-first search
▸ Rhymes of depth-first search
▸ Invented words related to depth-first search