Breadth-first search (BFS) is an algorithm for searching a tree data structure for a node that satisfies a given property. It starts at the tree root and...

lexicographic breadth-first search or Lex-BFS is a linear time algorithm for ordering the vertices of a graph. The algorithm is different from a breadth-first search...

search path as well as the set of already-visited vertices. Thus, in this setting, the time and space bounds are the same as for breadth-first search...

possible, such as depth-limited searches like iterative deepening depth-first search. The latter, as well as breadth-first search, can also be used to traverse...

The breadth-first-search algorithm is a way to explore the vertices of a graph layer by layer. It is a basic algorithm in graph theory which can be used...

the algorithm) have already been visited. Both the depth-first and breadth-first graph searches are adaptations of tree-based algorithms, distinguished...

, the cumulative order in which nodes are first visited is effectively the same as in breadth-first search. However, IDDFS uses much less memory. The...

processed in specific ways to increase efficiency. Breadth-first search (BFS) and depth-first search (DFS) are two closely-related approaches that are...

weight of the path from the starting node, only the individual edges. Breadth-first search can be viewed as a special-case of Dijkstra's algorithm on unweighted...

search algorithm. Special care needs to be taken for the stopping criterion. Breadth-first search Depth-first search Any-angle path planning, search for...