breadth-first search

from The Free On-line Dictionary of Computing (8 July 2008)

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}.

   (1996-01-05)