Discussion:
Implement Dijkstra's shortest path algorithm, findShortestPath.
Suggestions:
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.
Project layout
The project has the following directory layout:
Dijkstra/
src/
all program source code
lib/
all project library dependencies
test/
all test classes
There may also be a separate directory storing your compiled classes.
Building and testing: