breadth first search


Also found in: Wikipedia.

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.
References in periodicals archive ?
Algorithm for connectivity of graph (include Breadth First Search and Depth First Search, adjacency matrix and genetic algorithm are all popular methods adopted to judge pathway connectivity [1].