An implementation of the k shortest paths algorithm in Java. This is a forked version which has NOT modified the implementation of the algorithm. The purpose of the fork was to enable more flexible Graph creation, i.e. programmatic construction of the Graph as an alternative to the construction from text file input. The location of the original work: https://github.com/yan-qi/k-shortest-paths-java-version