breadth-first search

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

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

• breadth-first search on Wikipedia.Wikipedia