Click on the grid to place start, end, and wall nodes. Run Dijkstra or BFS to find the shortest path with animation.