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)