Dijkstra Shortest Path
Shortest PathMediumCalculate single-source shortest paths on weighted graphs using greedy edge relaxation.
Alt+Shift+J
Configuration Panel
Complexity Mappings
Time ComplexityO(E log V) / O(V^2)
Space ComplexityO(V + E) priority heap & tables
Interactive SVG Graph Canvas
🖱️ Middle-drag to Pan🎡 Scroll wheel to Zoom⌨️ Shift-drag snap to 20px grid
Inspector Panel
Select a vertex or edge to inspect details.
Graph Wizard
Conceptual Overview
Dijkstra's Algorithm finds the shortest paths from a single source node to all other nodes in a graph with non-negative edge weights.
Algorithm Mechanism
Repeatedly selects the unvisited node with the smallest tentative distance, relaxes all of its outgoing edges, and marks it as visited.
Source: CP-Algorithms reference guide