1. This unit is all about
Puzzles
Games
Strategy

2. MAMDMA2.a Solve problems represented by a vertex-edge graph, and find critical paths, Euler paths, and minimal spanning trees. What is Graph Theory? What is an Euler Circuit?

3. Let’s take a tour through the city of Konigsberg

4. SEGWAY TOURS $49.95

8. 1. Starts and ends in the same place 2
1. Starts and ends in the same place 2.Crosses every bridge, but only once
Carl’s Tours
Alison’s Tours
Briana’s Tours
Dave’s Tours

10. Can you visit each one of the exhibits without back tracking

11. Possible Solution

13. Points or vertices are land Lines or edges are bridges

14. Points or vertices are land Lines or edges are bridges

15. Euler Paths and Circuits
Euler Path – you can find a path through all vertices that uses every edge exactly once.
Euler Circuit – a Euler Path that begins and ends at the same place
The Eastern Garden was a _______