|
|
Definition of Breadth-first search
1. Noun. (graph theory) a search algorithm that begins at the root node and explores all the neighboring nodes ¹
¹ Source: wiktionary.com
Lexicographical Neighbors of Breadth-first Search
Other Resources:
|
|
1. Noun. (graph theory) a search algorithm that begins at the root node and explores all the neighboring nodes ¹
¹ Source: wiktionary.com