On 09.03.2016 22:58, Philipp-Maximilian Jacob wrote:
The known path is three steps long (i.e. contains four vertices) while the paths returned by all_shortest_paths are only two steps long. Is there any way of extending the cut off criterion for all_shortest_paths so that it would return the known path too?
So, you want a function that returns all shortest paths to return a path that is not the shortest one? There is no "cut off criterion"... The algorithm finds the shortest paths, which in this case are paths of length two.
It seems to me as if graph.edge(u,v) only returns one edge when called.
Please take a more careful look at the documentation: https://graph-tool.skewed.de/static/doc/graph_tool.html#graph_tool.Graph.edg... Note what it says about the "all_edges" argument: "If all_edges=True then a list is returned with all the parallel edges from s to t, otherwise only one edge is returned." Best, Tiago -- Tiago de Paula Peixoto <tiago@skewed.de>