| Problem: |
To create a program that will determine the quickest route from node A to
all other nodes, based on the following times in nanoseconds, and using
Dijkstra's
algorithm.
| |
A |
B |
C |
D |
E |
| A |
0 |
5 |
2 |
7 |
1 |
| B |
|
0 |
1 |
2 |
5 |
| C |
|
|
0 |
3 |
2 |
| D |
|
|
|
0 |
3 |
| E |
|
|
|
|
0 |
|
| Task: |
- Design an algorithm to solve the above problem. This should include
UML class diagrams showing all classes (with members) and class relationships.
- Create a program based on this design.
- Submit copies of your handwritten design (algorithm), printouts of
all source code files, a printout of your output file, and an
executable version of your program on disk.
|
| Notes: |
- Start right away! The sooner you ask questions,
the sooner you'll complete this project.
- Please refer to Project Submission Guidelines
for more information on how to submit a project.
- Feel free to add whatever features you wish to this program. These
additions will be critiqued but will have no impact on your project grade
whatsoever.
|