Chapter 14.2, Problem 33E

Parking Pattern The map shows the roads on which parking is permitted at a national monument. This is a pay-and-display facility. A security guard has the task of periodically checking that all parked vehicles have a valid parking ticket displayed. He is based at the central complex, labeled A. Is there a route that he can take to walk along each of the roads exactly once, beginning and ending at A? If so, use Fleury's algorithm to find such a route.