breadth-first search

Definition from Wiktionary, the free dictionary

Jump to navigation Jump to search

English[edit]

Noun[edit]

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[edit]

a search algorithm

Esperanto: larĝema trairo, larĝiĝema trairo
Finnish: leveyshaku
German: Breitensuche
Icelandic: þverleit f, breiddarleit f
Italian: visita in ampiezza f
Polish: przeszukiwanie wszerz n

Further reading[edit]

breadth-first search on Wikipedia.Wikipedia

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