Consider
using LightGraphs
g = SimpleDiGraph(7)
add_edge!(g, 1, 2)
add_edge!(g, 2, 3)
add_edge!(g, 4, 5)
add_edge!(g, 5, 3)
add_edge!(g, 1, 5)
add_edge!(g, 6, 7)
add_edge!(g, 7, 3)
add_edge!(g, 1, 7)
p = dijkstra_shortest_paths(g, 1)
julia> enumerate_paths(p, 3)
3-element Array{Int64,1}:
1
2
3
rem_edge!(g, Edge(1 => 2))
p = dijkstra_shortest_paths(g, 1)
julia> enumerate_paths(p, 3)
3-element Array{Int64,1}:
1
5
3
I think there must be an option that I am missing for the function call? Is there a way to get all of the same-distance shortest paths with calling dijkstra_shortest_paths? I would like ideally to get
[[1, 2, 3], [1, 5, 3], [1, 7, 3]] using the original edges and a call to the djkstra routine.