breadth first search

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].
This paper is therefore limited to comparing the implementations of the popular AI algorithms, namely Breadth First Search, Depth First Search, A*, Best First Search and Hill climbing algorithms for solving a sliding n-puzzle in an attempt to look at the better efficient of the algorithms for this case.
This paper attempts to demonstrate the implementation of Breadth First Search, Depth First Search, A*, Best First Search and Hill Climbing algorithms for solving a sizeable sliding puzzle and for solving an 8 queen puzzle.
There are 5 different search algorithms that are explored in this paper, namely the Breadth First Search, Depth First Search, A*, Best First Search and Hill Climbing.
The Breadth First Search is an uninformed type algorithm, so it does not start will full knowledge of the entire State Space.
In the diagram for Breadth first search (figure 4), there are three examples given ach with a different initial queen.
Depth first search is similar to breadth first search.
Breadth First Search, Depth First Search and Best First Search can only generate one board which same each time it is run.