Concepts2
⚙️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
⚙️AlgorithmIntermediate
0-1 BFS
0-1 BFS is a shortest path algorithm specialized for graphs whose edge weights are only 0 or 1.
#0-1 bfs#binary weights#shortest path+12