Dijkstra's Shortest Path

Graph Type

Start Node

Target Node (Optional)

Speed: 1000ms

Frame 1 of 0

Graph Type

Start Node

Target Node (Optional)

Graph Info:

Nodes: 4

Edges: 5

Type: Directed

Speed: 1000ms

Frame 1 of 0

Shortcuts: Space (play/pause), ← → (step), R (reset)

Select start and target nodes to begin

Time Complexity: O((V + E) log V)

Space Complexity: O(V)

Current

Visited

Tentative

Shortest Path

Shortest Path

Being Relaxed

Visited Connection

Regular

Select start and target nodes to begin

Time: O((V + E) log V)

Space: O(V)