The Java application is an implementation of Dijkstra's Algorithm to determine shortest paths from nodes to nodes in a graph.
For clarification, I included a PDF document where the graphs are drawn out together with the shortest distance from the source node to any other node for several test cases.
These test cases can be loaded into the application and will give the same results.
Please contact me prior to distributing any files.