C ++ k shortest path algorithm

Question

Does anyone know if there is any production-ready K-shortest-pathsalgorithm for C++?

The only available implementation ( k-shortest-paths ), unfortunately, is a memory leak, has intuitive interfaces, and another “reinvented wheel” is a Graphclass.

I am looking for something better, perhaps boost::graph.

Two possible algorithms are available: simple Yen algorithmand optimized Yen algorithm, both will suit me.

Thanks in advance.

Answer 1

There is one more, but you will need to check for a memory leak.

http://sourceforge.net/projects/ksp/files/ksp/ksp-1.0/