Draw a complete, weighted graph that represents these cities and the costs associated with flying between each pair of cities.

Come up with a list of three cities you would like to visit. Search for airline prices between these three cities. Make sure to include the city with the airport nearest your home from which you would start and end your trip.(From Burbank, CA)
a) Draw a complete, weighted graph that represents these cities and the costs associated with flying between each pair of cities. (
b) Use the brute force method to determine the optimal solution to visiting each city and returning home.
c) Use the nearest neighbor method to approximate the optimal solution.
d) How much money does the optimal solution, obtained from the brute force method in part (b), save you over the nearest neighbor method obtained in part (c)?
Please label your neat and clear work with the letters above and the correct graph theory vocabulary in your explanations. Provide a post of at least 200 words.
Read and respond to at least two students’ posts with at least 100 words each.

Last Completed Projects