Dijkstra's Algorithm - DAA Visualizer

Graph Canvas

Start

Current

Visited

Path

Speed:

Click "Play" or "Step" to begin the visualization.

Stats

Step

Visited

Time

O((V+E)logV)

Space

O(V)

Distance Table

Node	Dist	Prev

Pseudocode

function dijkstra(graph,
                                    start):
 dist[start] ← 0
 for each vertex v in graph:
                                
 if v ≠ start:
 dist[v] ← ∞
 add v to priority queue Q
                                
 while Q is not empty:
 u ← vertex with min dist[u]
                                
 remove u from Q
 for each neighbor v of u:
                                
 alt ← dist[u] + weight(u,v)
                                
 if alt < dist[v]:
 dist[v] ← alt
 prev[v] ← u
 return dist, prev
                                        

Graph Visualization

Graph Canvas