Category
Level
Dijkstra’s algorithm can be adapted to track the second shortest path by keeping the best and second-best distances per vertex.