Starting from node A, BFS explores all neighbors at the current depth before moving to the next level.

Example Graph for BFS Traversal

BFS Traversal Steps

1. Visit A, enqueue for exploration.
2. Dequeue A, enqueue neighbors B, D, E.
3. Dequeue B, enqueue neighbors not yet visited: C.
4. Dequeue D, neighbors already visited or enqueued.
5. Dequeue E, enqueue neighbors not yet visited: F.
6. Dequeue C, enqueue neighbors not yet visited: G.
7. Dequeue F, neighbors already visited or enqueued.
8. Dequeue G, neighbors already visited or enqueued.

BFS Order

A → B → D → E → C → F → G