Breadth First Search

Breadth first search for a graph is a way to traverse the graph. It starts at the root node and explores all of the neighbor nodes at the present depth prior to moving on to the nodes at the next depth level.

Visit the following resources to learn more:

• Breadth First Search or BFS for a Graph
• Graph Algorithms II - DFS, BFS, Kruskals Algorithm, Union Find Data Structure - Lecture 7
• Breadth-first search in 4 minutes