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
⚙️AlgorithmIntermediate
Dijkstra - Variations and Applications
Dijkstra’s algorithm can be adapted to track the second shortest path by keeping the best and second-best distances per vertex.
#dijkstra#second shortest path#k shortest paths+12