The famous Bridges of Konigsberg Problem: Can you cross all seven bridges over the river in a single trip, arriving back at your starting point and without crossing any bridge twice? In graph theory, this is the same as asking whether there is an Eulerian circuit on a multigraph with four nodes and seven edges. The great Swiss mathematician Leonhard Euler proved in 1736 that the answer is no. (Image by MIT OCW.)