Concepts2
⚙️AlgorithmIntermediate
Dijkstra's Algorithm
Dijkstra's algorithm finds shortest path distances from one source to all vertices when all edge weights are non-negative.
#dijkstra#shortest path#greedy+11
🗂️Data StructureIntermediate
Priority Queue (Heap)
A priority queue returns the highest-priority element first and is efficiently implemented by a binary heap.
#priority queue#binary heap#min-heap+11