1 / 7

I can Recognize an Euler path or Euler Circuit in a graph.

I can Recognize an Euler path or Euler Circuit in a graph. 1. How do I recognize an Euler path in a graph? 2. How do I recognize an Euler circuit in a graph?. Leonhard Euler. By Samantha Lauderdale, DWE, VSD. Have you ever solved a maze? How did you find your way through it?.

soyala
Télécharger la présentation

I can Recognize an Euler path or Euler Circuit in a graph.

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. I can Recognize an Euler path or Euler Circuit in a graph. • 1. How do I recognize an Euler path in a graph? • 2. How do I recognize an Euler circuit in a graph? Leonhard Euler By Samantha Lauderdale, DWE, VSD

  2. Have you ever solved a maze? How did you find your way through it? Finding an Euler circuit or path in a graph is like solving a maze!

  3. Linda is selling girl scout cookies. She wants to visit every street in her neighborhood, and end up back where she started. Which of these is a route that would be an EULER CIRCUIT? LET’S TRY ROUTE A! LET’S TRY ROUTE B! LET’S TRY ROUTE C! YES! It works! We touched each edge once, and finished where we started. NO! It doesn’t work because we touched the same edge twice! NO! It doesn’t work because we missed three edges! A X a) A,B,C,D,E,F,G,H,C,B,A b)A,B,H,C,D,E,F,C,B,G,A c)A,B,C,D,E,F,C,H,G,F,H,B,G,A d)A,G,B,H,F,E,D,C,B,A X G X B X X H X X X X F X C X X X D E

  4. Luke lost his library book somewhere at school. He needs to visit each hallway once to look for it. What is a possible Euler path that he can take through the school? LET’S TRY ROUTE A! LET’S TRY ROUTE B! YES! It works! We touched each edge exactly once! NO! It doesn’t work! We missed three edges! G H a) G,H,F,E,D,C,B,I,H,A,B b) B,C,D,E,F,G,H,A,B,I,F,H,I,D c) H,F,E,D,C,B,A,H,G,F,I,B d)G,F,E,D,C,B,A,H,I,F,G,H F I A E B D C

  5. D D D D D D D D Ellen’s mom needs to go to several stores in town. She wants to go down each road only once, and finish back at her house, where she started. Which of these possible routes would be an Euler Circuit? LET’S TRY ROUTE A! LET’S TRY ROUTE B! LET’S TRY ROUTE D! LET’S TRY ROUTE C! YES! It works because we touched each edge once, and finished where we started! NO! It doesn’t work because we touched an edge more than once! NO! It doesn’t work because we touched an edge more than once! NO! It doesn’t work because we touched an edge more than once! D F X a)F,G,H,B,A,E,D,C,B,A,E,F b)H,G,F,E,A,B,C,D,E,A c) F,E,D,E,A,B,H,G,F,E,B,C,D d) A,B,C,D,E,F,G,H,B,E,A X X E A C B G H

  6. Tyler baked some cookies for his neighbors. He wants to go down each street in his neighborhood only once. What is a possible path that he can take to deliver his cookies? LET’S TRY ROUTE C! LET’S TRY ROUTE A! LET’S TRY ROUTE B! YES! It worked because we touched each edge once! NO! It didn’t work because we didn’t touch one edge! NO! It didn’t work because we didn’t touch one edge! B C X X X a) C,D,E,F,A,B,C b) E,F,A,D,C,B,A c) D,C,B,A,D,E,F,A d) A,B,C,D,E,F,A A X D X X F X E

  7. How does solving a maze relate to recognizing an Euler Path or circuit in a graph? Write the answer on your slate!

More Related