A policeman has to patrol on foot the streets of the subdivision shown in Fig. 61. The
Chapter 5, Problem 65(choose chapter or problem)
A policeman has to patrol on foot the streets of the subdivision shown in Fig. 61. The policeman needs to start his route at the police station, located at X, and end the route at the local coffee shop, located at Y. He needs to cover each block of the subdivision at least once, but he wants to make his route as efficient as possible and duplicate the fewest possible number of blocks. (a) How many blocks will he have to duplicate in an optimal trip through the subdivision? (b) Describe an optimal trip through the subdivision. Label the edges 1, 2, 3, and so on in the order the policeman would travel them.
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer