🇬🇧 en fi 🇫🇮

breadth-first search noun

  • (graph theory) A search algorithm that begins at the root node and explores all the neighboring nodes.
 leveyshaku
Wiktionary Links