2D Pathfinding Grid — A*, Dijkstra & BFS Visualizer

This 2D companion to the 3D Pathfinding simulator runs the exact same graph-search algorithms — A*, Dijkstra, Greedy Best-First and BFS — on a flat top-down grid drawn with plain 2D canvas fills instead of a WebGL texture quad. The open set, closed set, heuristic and edge relaxation are all real: nothing here is a pre-baked animation of a path, the frontier expands one popped node at a time exactly as the algorithm dictates, so a slower or buggier heuristic visibly explores more cells before it reaches the goal.