Breadth-first search

lastmod 2020-09-20created 2016-11-285 edits

Breadth-first search (BFS) is a blind search method that visits the start vertex and then first visits all vertices adjacent to the start vertex. Breadth-first search is also applied to all unvisited vertices until there are no unvisited vertices left. The OPEN List must use a queue to be accessed in level order.

Implementation

• (Graph) BFS and DFS

Breadth-first search is easily implemented with a Queue.

See also

• Tree traversal
• Depth-first search (DFS)

Favorite site

• Wikipedia (en) Breadth-first_search