Shortest path

[filchristou]

Is there a well-defined way/example of how to solve shortest path for Multigraphs.jl ? Since weights(mg::Multigraph) returns a N x N matrix, where N is the vertices number, I see that there is not the capability to have granular weights per sub-edge. For shortest path giving the minimum of the subedges to the N x N matrix will probably work, but there are complications if I want to find the first k shortest paths.. Are there any guidelines in the matter ?

(sorry for storming the package in the last couple of hours!)

[ChenZhao44]

In the current implementation, there is no capability for different weights on different simple edge in a multi-edge. Hence, the shortest path in Multigraphs.jl is impossible.