# Seven Bridges of Königsberg

(diff) ←Older revision | Current revision (diff) | Newer revision→ (diff)

Seven Bridges of Königsberg

The Seven Bridges of Königsberg is a historical problem that illustrates the foundations of graph theory.

# Basic Description

The setting of the problem is the city of Konigsberg in Prussia. The city is divided by a river with two islands. The four parts of the city are linked by seven bridges.

The problem is essentially to walk through the city and cross each bridge once and only once.

## Solution

While we could literally test out every possible case by hand, this would be extremely tedious and prone to error. Instead we will analyze the problem abstractly. By abstract, we mean to essentialize the problem; in this case, eliminating all features possible.

Our first step is to remove the distractions of the image itself.

# Teaching Materials

There are currently no teaching materials for this page. Add teaching materials.

Have questions about the image or the explanations on this page?