Breadth-First Search (BFS)
- Explores the graph level by level.
- Uses a queue to track the next frontier.
- Visits all neighbors before going deeper.
- Finds the shortest path in unweighted graphs.
A
B
C
D
E
Start at A. Visit neighbors B and C. Then visit neighbors of B and C.