Dijkstra's Algorithm

Algorithm Description

Key Features

• Finds shortest path in weighted graphs
• Uses greedy approach
• Time complexity: O((V+E)logV)

Steps

1. Initialize distance values
2. Select vertex with minimum distance
3. Update neighbor distances