breadth-first search
English
editNoun
editbreadth-first search (countable and uncountable, plural breadth-first searches)
- (graph theory) A search algorithm that begins at the root node and explores all the neighboring nodes.
- Synonym: BFS
- Coordinate term: depth-first search
Translations
edita search algorithm
|
Further reading
edit- breadth-first search on Wikipedia.Wikipedia