Computes K-shortest path for a given network topology. This is based on Yen's algorithm
Generates k-shortest paths for the given network topology. This script is written in python and uses networkx library for the graph data-structure.
Topology information is given as the part for nodes.csv, and links.csv Output: Creates a *.csv file that lists k-shortest paths between given source and target file