Definitions from Wiktionary (breadth-first search)
▸ noun: (graph theory) A search algorithm that begins at the root node and explores all the neighboring nodes.
▸ Words similar to breadth-first search
▸ Usage examples for breadth-first search
▸ Idioms related to breadth-first search
▸ Wikipedia articles (New!)
▸ Words that often appear near breadth-first search
▸ Rhymes of breadth-first search
▸ Invented words related to breadth-first search
▸ noun: (graph theory) A search algorithm that begins at the root node and explores all the neighboring nodes.
Similar:
breadth,
iterative deepening search,
arborescence,
binary search,
generalized search tree,
Borůvka's algorithm,
rootfinder,
Bellman-Ford algorithm,
small-world network,
British Museum algorithm,
more...
Phrases:
▸ Words similar to breadth-first search
▸ Usage examples for breadth-first search
▸ Idioms related to breadth-first search
▸ Wikipedia articles (New!)
▸ Words that often appear near breadth-first search
▸ Rhymes of breadth-first search
▸ Invented words related to breadth-first search