Chapter 14.2, Problem 46E

In Exercises 45-18, we revisit the four-block; neighborhood discussed in the previous section. Recall that a mud currier parks her truck of the intersection shown in the figure and then walks to deliver mail to each of the houses. The streets o-n the outside of the neighborhood have houses on one side only The interior streets have houses on both sides of the street On these streets, the mail currier must walk down the street twice, covering each side of the street separately. A graph that models the streets of the neighborhood walked by the mail carrier is shown.

Use trial and error or Fleury’s Algorithm to find an Euler circuit that starts and ends at vertex B on the graph that models the neighborhood.