This program will compute the shortest paths between 2 nodes in a given network by supplementing existing code with your own. It will count path length comparisons as well as print the paths found -- given a certain set of input.
**SEE ATTACHED FILE** for more information.
Complete and fully-functional working program(s) in executable form as well as complete source code of all work done.
The CPP/H/DSP/DSW files that come out of Visual C++ 6.0 are required.
Also - the code must be commented as much as possible so that it is clear what everything is for -- and if you use code from an external source it must be noted.
ALSO NEEDED is documentation and discussion of results (output of program) -- and if possible, time complexity for shortest path algorithm in terms of comparisons vs Theoretical time complexities.
The more documentation the better :)
As long as the program compiles successfully in MS Visual C++ 6.0 - then that is fine.