A graph search algorithm which tries all one-step extensions of current paths before trying larger extensions. This requires all current paths to be kept in memory simultaneously, or at least their end points.Opposite of depth-first search. See also best first search.
Last updated: 1996-01-05
BRB ♦ breadcrumbs ♦ breadth-first search ♦ break ♦ break-even point
Try this search on Wikipedia, Wiktionary, Google, OneLook.