Dijkstra's Algorithm

Overview

Dijkstra's Algorithm is a fundamental algorithm which finds the shortest path in a graph form start node to all other nodes.

Key Features

• Is the fastest, single start, shorest path algorithm for directed and undirected graphs
• Works on graphs with non-negative, unbounded weights
• Utilizes a priority queue for improved performance

Algorithm Steps

How It Works:

1. Initialize the distance to the source as 0 and all other nodes as infinity.
2. Select the vertex with the minimum distance value.
3. Update the distances of its adjacent vertices.
4. Repeat until all vertices have been visited.