Shortest and Cheapest path Home [C Programming] #11
Description
Write a C program, to help ship packages to their destination using the shortest path algorithm and greedy algorithms:
- The input to the program will be a .csv file, which should look as follows:
| Name of Item | Value of Item (Value from 0-100) | Source | Destination |
|---|---|---|---|
| Duffle Bag | 90 | New York | London |
- Use graphs for representing the nodes/cities and the connections and prices for transit between them
- The graph edges must be randomly generated
- The nodes themselves can be static/fixed in the program
- The weight/price of the edge must also be randomly generated
- Maximum of 10 items are allowed in this problem
- Names of cities or items need not be real A, B, C... or 1, 2, 3 is enough
- Use a priority queue to ship out packages with higher value first
- Make sure that the total distance travelled for shipping all the packages and the total cost spent on shipping them is minimised.