Chapter 14, Problem 12CT

Decide whether the problem can be solved using Euler paths, Hamilton paths, or trees.

(a)    A civil engineer needs to drive once over every road in a neighborhood to check for salt damage after an especially snowy winter.

(b)    A group of friends goes to Epcot in Orlando on a 97 degree day and wants to visit 7 different attractions while doing the least possible amount of walking.

(c)    A UPS driver has 22 deliveries to make before lunch and wants to find the most time-efficient route.

(d)    Two roommates plan a spring break road trip. The plan is to visit friends at four different colleges then return home while driving the shortest distance.

(e)    A police officer on patrol is ordered to drive down every street on the west end of town before returning to the station to clock out.

(f)    When a new campus building is being planned, the IT team is asked to wire five computer classrooms on the fifth floor to the campus network using the least amount of network cable possible.