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)