C programming (not C++)

Firstly, convert the data to a graph. Secondly, using any kind of algorithm like Dijkstra, Bellman-Ford, etc. you should be able to get the shortest paths between points

Get scan input from the user to input a starting city and a destination city and then get the shortest path between it.

Here is the data to use:

Problem 3 (55 points): A transportation network as shown in the Figure can be represented as a two-dimensional integer array with rows and columns indexed by the cities in the network. The number stored at position (K, J) of such an array represents the distance of the link between two cities. Zero indicates that two cities are not directly linked. Write a recursive program, which, for input of two cities, outputs all possible paths connecting the two cities. Then modify the program so that t outputs only the shortest path linking the two cities As part of the submission provide a few runs for different cities. Seattle 2060 Minneapolis New York 1217 Milwaukee 2257 San Francisco Las Vegas Washingtor D.C. I 1780 1614 272 Phoens Oklahoma Los Angeles 1440 1o City 51 New Orleans Miami Grading: Comments Functioning code Recursive implementation Well-written code Correct results, ordered output Modification for shortest path Full submission NO recursion 5 points 10 points 14 points 8 points 10 points 5 points 3 points -30 points Problem 3 (55 points): A transportation network as shown in the Figure can be represented as a two-dimensional integer array with rows and columns indexed by the cities in the network. The number stored at position (K, J) of such an array represents the distance of the link between two cities. Zero indicates that two cities are not directly linked. Write a recursive program, which, for input of two cities, outputs all possible paths connecting the two cities. Then modify the program so that t outputs only the shortest path linking the two cities As part of the submission provide a few runs for different cities. Seattle 2060 Minneapolis New York 1217 Milwaukee 2257 San Francisco Las Vegas Washingtor D.C. I 1780 1614 272 Phoens Oklahoma Los Angeles 1440 1o City 51 New Orleans Miami Grading: Comments Functioning code Recursive implementation Well-written code Correct results, ordered output Modification for shortest path Full submission NO recursion 5 points 10 points 14 points 8 points 10 points 5 points 3 points -30 points