(algorithm)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 first search.