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

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? -- Sent from: http://main-discussion-list-for-the-graph-tool-project.982480.n3.nabble.com/