Dijkstra's Algorithm Visualization
Find shortest paths from a source vertex to all other vertices in a weighted graph
Add Vertex
Add Weighted Edge
Weighted Graph Visualization
Add vertices and weighted edges, then run Dijkstra's algorithm!
Distances from
Algorithm Status
Vertices: 0
Edges: 0
Processed: 0
Complete: No
Legend
Unprocessed Vertex
Current Vertex
Processed Vertex
Shortest Path
Dijkstra's Algorithm Properties
Time Complexity
O((V + E) log V)
Space Complexity
O(V)
Edge Weights
Non-negative
Use Cases
GPS navigation, Network routing