Traveling Networks

Home Up

Traveling Networks
 

The Konigsberg Bridge problem is a famous mathematical problem studied by many students in geometry. As you found out through the class discussion it is not possible to travel over all seven bridges between the two islands and the two sides of the river banks. The Konigsberg Bridge problem can be reduced to the following diagram of points and lines where the points represent the four pieces of land the lines represent the seven bridges between the four pieces of land.

Directions

Networks

Network Chart

Network Chart Answers

Network Chart Answer Color Coded

Sample Student Project