How it Works
Dijkstra's algorithm finds the shortest path between nodes in a weighted graph. It is a greedy algorithm that explores the closest unvisited vertices first.
Core Steps:
- Mark all nodes unvisited and set distance to infinity.
- Assign zero distance to the starting node.
- Select the unvisited node with the smallest current distance.
For a deeper dive, visit the Wikipedia Page.