breadth-first search

== English == === Noun === breadth-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 ==== === Further reading === breadth-first search on Wikipedia.Wikipedia