Looking for a C++ implementation of the k-shortest vertex(i.e. node)-disjoint paths algorithm

I am looking for a C++ implementation of the k-shortest paths algorithm.
The version I am looking for should be:
1. vertex-disjoint (i.e., node-disjoint)
2. find k paths such that each graph node is included in a path


Source: c++

Leave a Reply