3/6/20

Konigsberg Bridge Problem

Objective:

• Learn about graph theory by solving the Konigsberg bridge problem

​Warm up: Students will start class by standing at a whiteboard with their chosen group

• define a Eulerian path and draw an example on your whiteboard.

​

Boardwork Activity: 

1. Draw a map of the problem
   
2. Determine the best route so that you can cross every bridge without crossing any of them twice.
   

​Guiding Questions: 

1. Draw a different arrangement of the problem
2. Where should I start and finish?
3. How many bridges does each island have? How does this matter?
4. Does having an even or odd number of bridges affect whether the problem is possible? Why or why not? 

Extension: Create a map with one more island between two land masses. What is the minimum number of bridges needed to create a Eulerian path? What are the minimum bridges needed to prohibit the path? Can you generalize it?