Priority Queue–Based Pathfinding

Dijkstra's Algorithm on a grid — step through the min-heap in real time

ready
Start (S)
Goal (G)
Current node
In priority queue
Visited
Shortest path
Wall
Speed
Draw:

Click cells to toggle walls. Switch to Start/Goal mode to reposition them. Step through to watch the PQ drive pathfinding.

Priority Queue (min-heap)

Run to see queue

Stats

Nodes visited0
PQ operations0
Path length
Path cost
Steps appear here