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:
--
>
> Message: 1
> Date: Tue, 15 Dec 2020 08:22:24 -0700 (MST)
> From: Ruhm
> To: graph-tool@skewed.de
> Subject: [graph-tool] Find best paths sorted by length with graph
> tools
> Message-ID: <1608045744698-0.p...@n3.nabbl
Hello,
I'm a beginner in graph algorithm, and I have trouble to find an efficient
solution for my issue.
My goal is to find X best paths between two vertices. Not only the shortest
paths, but sub optimals path, ordered by length.
My graph is relatively small (10k vertices, 20k edges) and is not
