Re: [graph-tool] Find best paths sorted by length with graph tools

Am 15.12.20 um 16:22 schrieb Ruhm:

My goal is to find X best paths between two vertices. Not only the shortest paths, but sub optimals path, ordered by length.

Finding the k-shortest paths is not yet implemented in graph-tool. You can see a simple version of the algorithm here: https://en.wikipedia.org/wiki/K_shortest_path_routing If you open an issue in the website with a feature request, I will implement it when I find the time. Best, Tiago -- Tiago de Paula Peixoto <tiago@skewed.de>