breadth-first search

Definition from Wiktionary, the free dictionary
Jump to: navigation, search

English[edit]

Noun[edit]

breadth-first search (plural breadth-first searches)

  1. (graph theory) a search algorithm that begins at the root node and explores all the neighboring nodes

Translations[edit]