we can now solve the 1 bridge problem. because the multigraph representing these bridges, show in figure 2, has four vertices of odd degree, it does not have an euler circuit. there is no way to start at a given point, cross each bridge exactly once, and return to the starting point.