New answers tagged

2

There are standard algorithms for finding the $k$ shortest paths in a graph: you provide $k$, and it returns the shortest path, second-shortest path, ..., up to the $k$th shortest path. See https://en.wikipedia.org/wiki/K_shortest_path_routing. I'd suggest that as a natural place to start.


Top 50 recent answers are included