In the mid-eighteenth century, the famed mathematician Leon hard Euler developed a special "path construction" argument to prove that it was impossible to make such a trip. Later, in the early nineteenth century the same problem was solved by representing the situation as a net- work in which each of the four sections (A, B, C, and D) is a node and each bridge is an arc joining applicable nodes, as shown in Figure 6.4.