Main Idea
Process in layers
Algorithm Steps
- Put the starting node into the queue AND mark it as visited
- Pull the first node out of the queue AND visit all its immediate neigh>
- Add those neighbors of the first node (from above) to the queue
- Repeat until queue is empty
For more details, visit this page BFS Wikipedia Page.