Skip to main content
DSA is fun

Dijkstra Shortest Path

Given a weighted graph and one start node, find the cheapest distance from that start node to every reachable node.

Read the full walkthrough →
Visualization step 1 of 40. ENQUEUE.
State
Qenqueue
Step 1 / 40
Graph Visualization
Priority queue: 1
100%
4215810263ABCDEF
Priority queue
A:0
Traversal
none yet
Distances
A0
Binf
Cinf
Dinf
Einf
Finf
blue active
amber queued
green visited
gray idle
Step 1 / 40
Step 1 of 40. ENQUEUE. Set distance(A) to 0 and put A into the priority queue.
Step Explanation1 / 40
ENQUEUE

Set distance(A) to 0 and put A into the priority queue.

Output0 results
No output yet.
Step forward to generate results.