Breadth First Search (BFS)

Guarantees the shortest path in unweighted grids by exploring level by level radially. Time: O(V+E).

Use case: Finding the minimum number of steps to escape a maze, or the closest enemy in a game matrix.