A computer company in the Silicon Valley area (see Figure 11-28) needs to route delivery vehicles between cities on the shortest route. Having studied data structures, you recognize that this is an application for Dijkstra's shortest path algorithm. To demonstrate your proposal, you decide to implement it on your computer. To do so you must complete the following tasks:
a. Convert the map in Figure 11-28 to a network and present it to management.
b. Modify the graph ADT to store weights in the arc nodes.
c. Write an interactive program that when given the start and destination displays the shortest route between them.
