Euler's Solution

To solve this bridge problem Euler changed the picture into a graph.

This is the original picture of the problem.


Euler simplified the picture by labeling the islands A and D and the shores of the river are B and C. The bridges are a, b, c, d, e, f, and g.


Euler simplified his graph one more time.  In this graph the vertices represent the land regions and the edges represent the paths over the bridges.

Euler used this final graph to analyze if it is traversable.  If it is traversable using this graph he would be able to analyze if it is a path or circuit.



Go back to look at Koingsberg Bridge Problem            Go forward to look at Euler's solution

Main Page
Other Links