Name: 

As a business person you need to visit each of the following cities once.  You need to start in Atlanta and end in Atlanta.  Use the “Nearest Neighbor” Algorithm to find one of the cheaper routes to visit each city and return home again.

 

Jaqueline  is using an online ride service to start from her home (vertex A) visit 4 consecutive destinations (B, C, D, E) and return home (vertex A). She first obtained all of the prices of traveling between locations and then, using the “Nearest Neighbor Algorithm” she would like to determine an inexpensive route to make a round trip and visit all 4 places.


Which route would the “Nearest Neighbor Algorithm” suggest?

Kelly is using an online ride service to start from her home (vertex A) visit 3 consecutive destinations (B, C, D) and return home (vertex A). She first obtained all of the prices of traveling between locations and then, using the “Brute Force Method” she created this diagram..


What would be the cost of the cheapest round trip from vertex A to all the other vertices once and back to vertex A?