BREADTH-FIRST SEARCH
\bɹˈɛdθfˈɜːst sˈɜːt͡ʃ], \bɹˈɛdθfˈɜːst sˈɜːtʃ], \b_ɹ_ˈɛ_d_θ_f_ˈɜː_s_t s_ˈɜː_tʃ]\
Sort: Oldest first
-
A graph search algorithm which tries allone-step extensions of current paths before trying largerextensions. This requires all current paths to be kept inmemory simultaneously, or at least their end points.Opposite of depth-first search. See also best firstsearch.
By Denis Howe
