Assume that all blocks are the same length.Finding the most efficient route. Repeat Exerci...

Assume that all blocks are the same length.

Finding the most efficient route. Repeat Exercise, but now assume that the deliveries must be made to B, E, H, I, J, and L.

Finding the most efficient route. Papa John’s Pizza is located at the position marked A on the map. Assume that deliveries must be made to locations B, D, E, H, F, and M, and then the delivery truck must return to the store.

---

a. Use the nearest neighbor algorithm to devise a delivery route that will minimize the number of blocks traveled. You may assume that all streets are two-way streets. (Hint: First make a table of the distances between the various locations, similar to what we did in Exercise)

---

b. Repeat part (a) using the best edge algorithm.