A search algorithm of a graph which explores all nodes adjacent to the current node before moving on. For cyclic graphs, care must be taken to make sure that no nodes are repeated. When properly implemented, all nodes in a given connected component are explored.

# Breadth-First Traversal

## See also

Depth-First Traversal## Explore with Wolfram|Alpha

## References

Skiena, S. "Breadth-First and Depth-First Search." §3.2.5 in*Implementing Discrete Mathematics: Combinatorics and Graph Theory with Mathematica.*Reading, MA: Addison-Wesley, pp. 95-97, 1990.

## Referenced on Wolfram|Alpha

Breadth-First Traversal## Cite this as:

Weisstein, Eric W. "Breadth-First Traversal."
From *MathWorld*--A Wolfram Web Resource. https://mathworld.wolfram.com/Breadth-FirstTraversal.html