Write a program in C++ to calculate the shortest-distance path between any two arbitrary nodes. The edge between any two nodes indicates there is a direct connection between the two nodes. The nodes can be represented by letters. The distance between any two adjacent nodes (2 nodes with an edge) is an integer number >= 1.
The input must be read from an input text file. Each line of text has three pieces of information that correspond to an edge in the graph and the length (weight) of the edge (distance between 2 nodes).
Input file example:
a b 3
b c 6
b f 1 etc, etc, etc...
The second set of input from the user should be to enter any two arbitrary nodes. For example: The input would be d b. The output would read: "The shortest path is d e f b" ...."The shortest distance is 8"
It is needed by 9AM tommorrow if it can be done that quickly. I am working on an extension but I cannot verify this right now.
1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done. MUST BE WELL DOCUMENTED.
2) Installation package that will install the software (in ready-to-run condition) on the platform(s) specified in this bid request.
3) Exclusive and complete copyrights to all work purchased. (No GPL, 3rd party components, etc. unless all copyright ramifications are explained AND AGREED TO by the buyer on the site).
4) It is needed by 9:00AM tomorrow Central time. Hopefully someone is able to do it quickly. I am working on an extension but I cannot verify this right now.
Windows (98, 2000, ME, NT, XP) and preferably using Visual C++ or making sure in can run in Visual C++.