"... In addition to that branch of geometry which is concerned with magnitudes, and which has always received the greatest attention, there is another branch, previously almost unknown, which Leibniz first mentioned, calling it the geometry of position. ..."

Soluti problematis ad geometriam situs pertinentis, Euler 1736

The Königsberg bridge problem asks if the seven bridges of the city of Konigsberg (*) over the river Preger can all be traversed in a single trip without doubling back, with the additional requirement that the trip ends in the same place it began. Euler proved in 1736 that there is no such traversal. (*) Königsberg = Kaliningrad in the Russian exclave between Poland and Lithuania.

Using Graph Theory the problem is equivalent to asking if the multigraph on four nodes and seven edges (see figure) has an Eulerian cycle. Using Mathematica we would model each bridge as an edge and the parts of the city as a vertex. There are different ways to create a graph in Mathematica, but this problem suits the method of creating a graph from an adjacency matrix. Since EulerianQ returns false we know that Mathematica confirms Euler's original answer.

## No comments:

## Post a Comment