To prepare for this Assignment:

Choose four cities you would like to visit.

• Consult the Internet and use one-way airfares between cities to create a weighted graph.

Assignment (1–2 pages including the images):

• Assume that you are located at A. Let B, C, D, and E represent each of the four cities you have chosen.
• Use the Brute Force Method to find the optimal solution to visiting each of our chosen cities and returning home. Show all your work.
• Use the Nearest Neighbor Method to approximate the optimal solution. Show all your work.
• Identify how much money is being saved by using the optimal solution instead of the approximation. Show all your work.
• Clearly label your work and identify each of the methods.
• Put all of your work into one document.
  Note: You may insert images into your document if you did the work by hand. Cite the resources, such as where you got the fares from, etc.

Attachments:

• 1492845062-Unit 1 - questions need help .2.docx