breadth-first search


Definition: Any search algorithm that considers neighbors of a vertex, that is, outgoing edges of the vertex's predecessor in the search, before any outgoing edges of the vertex. Extremes are searched last. This is typically implemented with a queue.

Aggregate child (... is a part of or used in me.)

See also depth-first search, best-first search.

Note: In a tree, equivalent to a level-order traversal.

Author: PEB

More information

Lecture notes from Design and Analysis of Algorithms on Breadth-first search and depth-first search.

Go to the Dictionary of Algorithms and Data Structures home page.

If you have suggestions, corrections, or comments, please get in touch with Paul Black.

Entry modified 22 April 2019.
HTML page formatted Mon Apr 22 12:17:39 2019.

Cite this as:
Paul E. Black, "breadth-first search", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 22 April 2019. (accessed TODAY) Available from: