Definitions from Wikipedia (Parallel breadth-first search)

▸ noun:  The breadth-first-search algorithm is a way to explore the vertices of a graph layer by layer.


▸ Words similar to Parallel breadth-first search
▸ Usage examples for Parallel breadth-first search

▸ Idioms related to Parallel breadth-first search
▸ Wikipedia articles (New!)
▸ Words that often appear near Parallel breadth-first search
▸ Rhymes of Parallel breadth-first search

▸ Invented words related to Parallel breadth-first search