Dijkstra's Shortest Path Algorithm

What is Dijkstra's Algorithm?

Dijkstra's Algorithm is used to find the shortest path between nodes in a graph. It works with weighted graphs and guarantees the shortest path when all weights are non-negative.

Steps of the Algorithm

• Start at the source node
• Update distances to neighboring nodes
• Select the node with the smallest tentative distance
• Repeat until all nodes are visited

Example Visualization

Learn More

Visit this page for more details: Dijkstra's Algorithm (Wikipedia)