breadth-first search

From Wiktionary, the free dictionary
Jump to navigation Jump to search
The printable version is no longer supported and may have rendering errors. Please update your browser bookmarks and please use the default browser print function instead.

English

Noun

breadth-first search (countable and uncountable, plural breadth-first searches)

  1. (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

Retrieved from "https://en.wiktionary.org/w/index.php?title=breadth-first_search&oldid=77942229"