Programming Assignment Bonus
Implement Dijkstra's shortest path algorithm
using the the provided Graph class. I have provided a edu.gmu.cs.Graph class
which contains an incomplete findShortestPath method.
A unit test is included to check your implementation.
Table of Contents
Download
The skeleton project may be downloaded here.
Submitting
This program is due December 13th.
Submissions are accepted over email, please use the subject line INFS 519 Program Bonus and send to both myself and the TA.
Requirements
- 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
- src/
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.