The network-based solution is that the desired round trip (starting and ending in one section of the city) is impossible, because there are four nodes and each is associated with an odd
number of arcs, which does not allow distinct entrance and exit (and hence distinct use of the
bridges) to each section of the city. 1 The example demonstrates how the solution ofthe problem
is facilitated by using network representation.