🌊 Breadth-First Search (BFS)

How It Works

BFS explores vertices level by level using a queue:

1. Start from source, add to queue
2. Dequeue a vertex, visit all unvisited neighbors
3. Add neighbors to queue
4. Repeat until queue is empty

Key Property: BFS finds shortest path (in terms of edges) in unweighted graphs!