Chapter 14.3, Problem 55E

Repeat questions 51 through 54, choosing four sites that you might be interested in visiting, but this time use the cheapest link algorithm rather than the nearest neighbor method. They can be pretty much anywhere as long as it’s reasonable to drive between them. (Honolulu and Phoenix would be silly, if not suicidal.)

51.    Use Google maps to find driving distances and times between all of these sites, and draw a complete weighted graph with driving times used as weights. Use the “in traffic” times that go along with the shortest route in terms of distance.