adapters-shortest-paths-core · Core adapter library with general classes and interfaces. For example it contains the Target (see the Adapter design pattern) interfaces. The adapter implementations with dependencies to adaptees are located in other libraries. (https://github.com/TomasJohansson/adapters-shortest-paths)
fork of bsmock k-shortest-paths · 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 make it a maven project. The location of the original work: https://github.com/bsmock/k-shortest-paths
fork of yan-qi k-shortest-paths-java-version · 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
adapters-shortest-paths-impl-yanqi · Adapter implementation (for the Target Adapter interfaces defined in 'adapters-shortest-paths-core') which uses 'fork of yan-qi k-shortest-paths-java-version' as the adaptee. ( the library located at URL https://github.com/TomasJohansson/k-shortest-paths-java-version is a fork of https://github.com/yan-qi/k-shortest-paths-java-version )
adapters-shortest-paths-impl-bsmock · Adapter implementation (for the Target Adapter interfaces defined in 'adapters-shortest-paths-core') which uses 'fork of bsmock k-shortest-paths' as the adaptee. ( the library located at URL https://github.com/TomasJohansson/k-shortest-paths is a fork of https://github.com/bsmock/k-shortest-paths )
adapters-shortest-paths · Adapter library and implementations for finding the shortest paths between two locations. This is useful for travel routing when you want to minimize the total time or total distance.
