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

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

This article is issued from Wiktionary. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.