Euler’s insight was that because you’re only supposed to cross each bridge once, to enter a new neighborhood you need a pair of bridges—one to get you in, another to get you out. So the solution is as simple as looking at the network plot and asking whether each point along your path, other than your beginning and end, has an even number of lines (a pair of bridges) attached.
