Graph Algorithm
Dijkstra's Algorithm
Visualize how Dijkstra's algorithm finds the shortest path between nodes in a weighted graph.
Controls
Configure and run the algorithm
Example Graphs
Load a predefined graph
Manual Build
Add nodes and edges
Dijkstra's algorithm requires non-negative edge weights
Graph is empty
Add nodes and edges or load example