Apply traveling salesman algorithm to find a route with the least total airfare that visits each...

 

Transcribed Image Text:

Apply traveling salesman algorithm to find a route with the least total airfare that visits each of the cities in this graph excluding Denver and starting from San Francisco, where the weight on an edge is the least price available for a flight between the two cities. a. Write the Adjacency Matrix. b. Construct a tree showing all the possibilities with their minimum costs. c. Use part (b) to find the best route with its cost. $329 Detroit San Francisco $189 $359 $179 $349 $279 $229 New York $69 $209 $379 Los Angeles Denver Apply traveling salesman algorithm to find a route with the least total airfare that visits each of the cities in this graph excluding Denver and starting from San Francisco, where the weight on an edge is the least price available for a flight between the two cities. a. Write the Adjacency Matrix. b. Construct a tree showing all the possibilities with their minimum costs. c. Use part (b) to find the best route with its cost. $329 Detroit San Francisco $189 $359 $179 $349 $279 $229 New York $69 $209 $379 Los Angeles Denver

Answer rating: 100% (QA)

First of all we will exclude the costs of Denver from the problem and make a matrix consisting o... View the full answer