breadth-first search

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

en-GB/ˈbɹɛdθ - ˈfɜːst ˈsɜːt͡ʃ/
en-US/ˈbɹɛdθ - ˈfɝst ˈsɝt͡ʃ/

カテゴリ：

uninformed search algorithmgraph traversal