Dijkstra's Algorithm Visualizer

Interactive • Minimal • Teaching-focused

Light

Click nodes to start/finish edges • Drag nodes to move

Mode: Speed: Normal

Source: Destination: Show Pseudocode

Idle

Pseudocode

1. initialize distances[] = ∞, dist[source] = 0
2. put all nodes into a priority set (or loop to find min)
3. while set not empty:
4.    u = node with smallest distance
5.    mark u visited
6.    for each neighbor v of u:
7.       alt = dist[u] + weight(u,v)
8.       if alt < dist[v]:
9.          dist[v] = alt
10.         prev[v] = u
11. reconstruct shortest path from prev[]

Step-by-step explanation

Algorithm Info

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

Use the speed slider to slow down or speed up animation.

Designed for university submission — Dark minimal UI • Interactive learning

Mini Quiz