breadth-first search

<algorithm> 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

Try this search on Wikipedia, OneLook, Google

Nearby terms:

Brazil « BRB « breadcrumbs « breadth-first search » break » break-even point » breakpoint