Groups
Category
Level
Dijkstra's algorithm finds shortest path distances from one source to all vertices when all edge weights are non-negative.
A priority queue returns the highest-priority element first and is efficiently implemented by a binary heap.