Grid Search (BFS & DFS)

Traverse 2D grids with breadth-first and depth-first search. Build a neighbor helper, then use it for flood fill, island counting, shortest paths, and largest-region sizing — the same tools behind paint-bucket fills, maze solvers, and image region detection.