Studying networks has been a topic of mathematics for several centuries. One problem in this area—one that relates to the study of topology—is what is known as the Koningsberg Bridge Problem.
This problem was one that was studied by Leonard Euler. The problem begins with a river that flows around two islands. One island, as the figure above shows, is connect to the outer banks by four bridges. It is connected to the second island by one bridge. The second island is connected to the outer shores by two bridges. Is it possible to take a walk that allows the walker to cross all bridges only once? As it turns out, it is not possible to cross all the bridges in one walk without crossing at least one bridge twice. Euler’s explorations of why this is so marked an important passage in the history of mathematics.
|
Draw lines between the points and to complete the Hamiltonian Circuit. See if you can make it around the circuit without running out of gas You can change this lab in several ways:
|
|---|