Suggestion: Make it possible to create Graphs progammatically i.e. without requring reading data from an input file.
To be able to do that I have forked the project and added a subclass:
https://github.com/TomasJohansson/k-shortest-paths-java-version/blob/7130ed623d6e7436cdb8294c0e142a8b4b29a18d/src/main/java/edu/asu/emit/algorithm/graph/GraphPossibleToCreateProgramatically.java
In that fork I also modified the base class:
TomasJohansson@7130ed6#diff-3f22d4d0d6c0cedfd6153c2a7fd93af8
Then I use it in another project, with adapters to three (currently) implementations for finding the shortest paths.
TomasJohansson/adapters-shortest-paths@e1d8aea#diff-0ae0b82fd57d2b630fa9fe1d21c5feb7
Here is a test case in that project where I can generate many edges programatically, and then verifies that the results are the same for the different implementations:
TomasJohansson/adapters-shortest-paths@98fcbef#diff-8442ab4e923beecaf3372279deb5c871
Suggestion: Make it possible to create Graphs progammatically i.e. without requring reading data from an input file.
To be able to do that I have forked the project and added a subclass:
https://github.com/TomasJohansson/k-shortest-paths-java-version/blob/7130ed623d6e7436cdb8294c0e142a8b4b29a18d/src/main/java/edu/asu/emit/algorithm/graph/GraphPossibleToCreateProgramatically.java
In that fork I also modified the base class:
TomasJohansson@7130ed6#diff-3f22d4d0d6c0cedfd6153c2a7fd93af8
Then I use it in another project, with adapters to three (currently) implementations for finding the shortest paths.
TomasJohansson/adapters-shortest-paths@e1d8aea#diff-0ae0b82fd57d2b630fa9fe1d21c5feb7
Here is a test case in that project where I can generate many edges programatically, and then verifies that the results are the same for the different implementations:
TomasJohansson/adapters-shortest-paths@98fcbef#diff-8442ab4e923beecaf3372279deb5c871