On 15.03.2016 13:36, P-M wrote:
I have compared the output of all_paths to that of all_shortest_paths on a network that I have which contains a reasonable number of "duplicate" edges (connecting the same two vertices but each having different edge properties). The shortest path connecting "source" and "target" comprises two edges.
Running all_shortest_paths(g,source,target) returns me a list of length 201. Running all_paths(g,source,target,2) returns me a list of length 11. It seems as if all_paths has "deduplicated" most of the list, however does contain a few "duplicate" paths (if I remove all "duplicate" paths I obtain a list of size 8). Why is that? Is this linked to one of them using a depth-first search while the other uses breadth-first?
This is a bug... I've fixed it in git. Best, Tiago -- Tiago de Paula Peixoto <tiago@skewed.de>