Breadth-First Search (BFS)

Explores a graph level by level from a source using a queue — the basis of unweighted shortest paths.