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 ?
In node embedding stage, resource requirement and breadth first search algorithm are introduced to sort virtual nodes, and a node fitness function is developed to find the best substrate node.
Song, "Scene shortest path solutions based on the breadth first search," Advanced Materials Research, vol.
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.
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.
Other than that, it operates over a Breadth First Search's motion of expansion.
* Breadth First Search: More complete and concise uninformed technique that manages to find the best solution using minimal computation but suffers from intensive memory use.
Breadth first search's initial state is an empty board.
In the diagram for Breadth first search (figure 4), there are three examples given ach with a different initial queen.
On end-vertices of lexicographic breadth first searches. Discrete Applied Mathematics, 158(5):434-443, 2010.