I am working with multigraphs (multiple edges between node-pairs) and would like to extract all shortest paths between two given nodes. Since these are multigraphs the paths should be edge sequences rather than node sequences. This seems to fall in between get.shortest.paths, which can return edge sequences, but just for one shortest path, and get.all.shortest.paths, which returns all shortest paths, but only as node sequences. Any suggestions?
_______________________________________________ igraph-help mailing list [email protected] https://lists.nongnu.org/mailman/listinfo/igraph-help
