breadth-first search
English
Noun
breadth-first search (plural breadth-first searches)
- (graph theory) A search algorithm that begins at the root node and explores all the neighboring nodes.
Translations
a search algorithm
|
|
This article is issued from
Wiktionary.
The text is licensed under Creative
Commons - Attribution - Sharealike.
Additional terms may apply for the media files.