Implementation of the edge-disjoint K-shortest paths in C++ using the boost graph library. Python wrappers are provided. Algorithm follows the approach of Suurballe 1974.
Install the boost library with your package manager and run cmake.
mkdir build
cd build
cmake ..
make
python3 src/setup.py install
Read/execute the demo.py file.