Question 2.78

48.

  1. For the two complete graphs that follow, find the costs of the nearest-neighbor tour starting at B and of the tour generated by the sorted-edges algorithm.
    image
  2. How many Hamiltonian circuits would have to be examined to find a shortest route for part (a) by the brute force method?
  3. Invent an algorithm different from the sorted-edges and nearest-neighbor algorithms that is easy to apply for finding TSP solutions.