Interactive 2D laboratory · Algorithms & Computer Science
Dijkstra Weighted Pathfinding Visualizer
Watch Dijkstra’s algorithm explore a weighted grid and reconstruct the lowest-cost route.
SIMULATION VIEWPORTMODEL ACTIVE
THE SCIENCE
Dijkstra’s algorithm repeatedly visits the unprocessed node with the smallest known path cost. Relaxing neighbouring edges guarantees an optimal path when edge weights are non-negative. Terrain colours represent different traversal costs.