Subject: [Boost-users] [BGL] k-shortest path
From: Ireneusz Szcześniak (irek.szczesniak_at_[hidden])
Date: 2015-10-08 08:43:10
Hi,
I need to find k-shortest paths, but there is no such algorithm in
BGL. I can get edge-disjoint k-shortest paths with a max-flow
algorithm, but I don't need the k-shortest path to be edge-disjoint --
that's too strict for me.
I would appreciate it if someone could share an implementation of the
Yen or Eppstein algorithms using BGL. I found some implementations on
the Internet, but they don't use BGL.
Thanks & best,
Irek