(algorithm)
Definition: A 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.
See also depth-first search, best-first search.
Note: In a tree, called a level-order traversal.
Author: PEB
Laboratory Resources on Search and Game Playing, Lecture notes on Uninformed Search, Lecture notes from Design and Analysis of Algorithms on Breadth-first search and depth-first search. A demonstration.
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black (paul.black@nist.gov).
Entry modified Mon Jan 10 10:39:07 2005.
HTML page formatted Mon Jan 10 12:06:21 2005.
This page's URL is http://www.nist.gov/dads/HTML/breadthfirst.html
