Dijkstra's Shortest Path

Priority-queue based shortest path algorithm. Greedily relaxes edges from the closest unvisited node. Guaranteed optimal for non-negative weights.

Click a node to set as source, then run Dijkstra's

Click canvas to select source node

Source In Queue Finalized Unvisited