Implement Dijkstra's shortest path algorithm, findShortestPath.
Write helper methods to find the next vertex or update the distance and predecessor structures.
Write tests for your helper methods, this will help ensure your code is correct.
The project has the following directory layout:
all program source code
all project library dependencies
all test classes
There may also be a separate directory storing your compiled classes.
Building and testing:
Use your IDE to build your code and run the included JUnit tests.© BrainMass Inc. brainmass.com October 10, 2019, 4:00 am ad1c9bdddf
Dijkstra's shortest path algorithm are examined.