This project assignment is to design and implement a method for the shortest path problem.
There are N cities on a traveling map. A salesman tries to find out the least expensive routes from any town to other N-1 cities, using a computer program, and he wants to share the program with other sales people in different cities on the map.
Your task is to develop a program for this salesman. You are required to use Dijkstras algorithm. Your program should put out a table with the path and the cost from each city to all the other cities. Start with the first city to all the other cities then continue with the second city to all the others and so on. Example output is shown below. You are given a code bocks starting project for this assignment. We will be developing the two functions required for the assignment in class. The two functions we will be developing are minimumPath() and assig5Output().
Example Output
Minimum path from A to A is 0 Path: A
Minimum path from A to B is 10 Path: A B
Minimum path from A to C is 50 Path: A D C
Minimum path from A to D is 30 Path: A D
Minimum path from A to E is 60 Path: A D C E
Minimum path from B to A is 70 Path: B A
Minimum path from B to B is 0 Path: B
Minimum path from B to C is 50 Path: B C
Minimum path from B to D is 100 Path: B A D
Minimum path from B to E is 60 Path: B C E
Minimum path from C to A is 50 Path: C A
Minimum path from C to B is 50 Path: C E B
Minimum path from C to C is 0 Path: C
Minimum path from C to D is 80 Path: C A D
Minimum path from C to E is 10 Path: C E
Minimum path from D to A is 70 Path: D C A
Minimum path from D to B is 70 Path: D C E B
Minimum path from D to C is 20 Path: D C
Minimum path from D to D is 0 Path: D
Minimum path from D to E is 30 Path: D C E
Minimum path from E to A is 110 Path: E B A
Minimum path from E to B is 40 Path: E B
Minimum path from E to C is 90 Path: E B C
Minimum path from E to D is 140 Path: E B A D
Minimum path from E to E is 0 Path: E