Category
Level
Dijkstra's algorithm finds shortest path distances from one source to all vertices when all edge weights are non-negative.