Am 26.02.19 um 02:12 schrieb sergzz: > I can't find a similar function in graph-tool, but I am sure this could be > implemented. The only thing I found was the all_shortest_paths function, but > that only returns the shortest path(s), in most cases only 1. Could you > point me in the right direction how to efficiently generate and store K > number of shortest paths for a specified node?
It's just called all_paths(): https://graph-tool.skewed.de/static/doc/topology.html#graph_tool.topology.all_paths -- Tiago de Paula Peixoto <[email protected]>
signature.asc
Description: OpenPGP digital signature
_______________________________________________ graph-tool mailing list [email protected] https://lists.skewed.de/mailman/listinfo/graph-tool
