Re: [graph-tool] Computing K number of shortest paths for a single end-node

Am 01.03.19 um 00:23 schrieb sergzz:

Thank you very much for your reply!!

Just to confirm, the all_paths function will return all paths starting from the shortest to the longest in that order? Meaning that if I generate 100 paths, the first one will be the shortest, 100th will be the longest, and 15th path will be the 15th shortest?

No, in this function the paths are not sorted by length, as it uses depth-first search. But note that the all_simple_paths() function from networkx does not sort them either. Best, Tiago -- Tiago de Paula Peixoto <tiago@skewed.de>