breadth first search

(redirected from 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 ?
Using this observation, we present a heuristic searching strategy based on a bounded breadth-first search to improve the performance of state space exploration.
In our case, we choose k = 4 for the bounded breadth-first search which returns a few cut sets K sets as a key parameter for the further computation, where
To conduct the benchmark measurement, Koji Ueno of Tokyo Institute of Technology and RIKEN, along with colleagues, used 82,944 of the K computer's 88,128 compute nodes to solve a breadth-first search of an extremely large graph of 1 trillion nodes and 16 trillion edges in 0.
Techniques such as Random Walk [5], Restricted Random Walk [6], Breadth-First Search [7], Intelligent BFS [8], Depth-First Search [9], Adaptive Probabilistic Search [10], Blackboard Resource Discovery Mechanism [11] are explained briefly in the following subsections.
Pseudocode for breadth-first search is shown in Figure 4.
Search-level control strategy was introduce to integrate the Breadth-First Search method (BFS) and Depth-First Search method (DFS).
3 Breadth-first Search algorithm Select start node repeat calculate: diff =quantity - [SIGMA] node if (diff==0) then found solution else for node = 1 .
In short, each search iteration performs complete breadth-first search for a state with strictly better evaluation.
algorithm always had the second fastest execution times, and the breadth-first search and Dijkstra's algorithm were the slowest.
Computer scientists ran level-set expansion, and bi-directional, breadth-first search against the data.
As it performs a breadth-first search in the state space, the first solution found will consist of a minimal number of steps.
The process applied in my system is currently a straightforward breadth-first search over the set of reachable states, which amounts to generating all terms t occurring in consequences of the form (equation 1).