Dijkstra finds the shortest path from a start node to all other nodes.
It works by always exploring the nearest unvisited node next.
Shortest Distance from A to Each Node:
Watch how these values update as the algorithm explores the graph
Click "Start" to find shortest paths from A to all nodes
How it works:
- Start with distance 0 to the starting node, ∞ to all others
- Always pick the unvisited node with smallest distance
- Update distances to its neighbors if a shorter path is found
- Mark the node as visited when done