Buy Me a Coffee at ko-fi.com

Breadth-first search

algorithm for searching the nodes of a graph in order by their hop count from a starting node

Pronunciation
/brɛdθ - fərst sərʧ/
/brɛdθ - fəːst səːʧ/