slide task 6
DESCRIPTION
task 6TRANSCRIPT
![Page 1: Slide task 6](https://reader035.vdocuments.mx/reader035/viewer/2022062514/55855637d8b42a54608b4dfb/html5/thumbnails/1.jpg)
FIREWIRE
TASK 6-Graph teory-
![Page 2: Slide task 6](https://reader035.vdocuments.mx/reader035/viewer/2022062514/55855637d8b42a54608b4dfb/html5/thumbnails/2.jpg)
WHAT DO YOU UNDERSTAND ABOUT :
Euler Path Euler Circuit
![Page 3: Slide task 6](https://reader035.vdocuments.mx/reader035/viewer/2022062514/55855637d8b42a54608b4dfb/html5/thumbnails/3.jpg)
DEFINITION EULER PATH
is a path that uses every edge of a graph exactly once.
![Page 4: Slide task 6](https://reader035.vdocuments.mx/reader035/viewer/2022062514/55855637d8b42a54608b4dfb/html5/thumbnails/4.jpg)
EULER PATH EXAMPLE
![Page 5: Slide task 6](https://reader035.vdocuments.mx/reader035/viewer/2022062514/55855637d8b42a54608b4dfb/html5/thumbnails/5.jpg)
DEFINITION EULER CIRCUIT
is a circuit that uses every edge of a graph
exactly once.
![Page 6: Slide task 6](https://reader035.vdocuments.mx/reader035/viewer/2022062514/55855637d8b42a54608b4dfb/html5/thumbnails/6.jpg)
EULER CIRCUIT EXAMPLE
![Page 7: Slide task 6](https://reader035.vdocuments.mx/reader035/viewer/2022062514/55855637d8b42a54608b4dfb/html5/thumbnails/7.jpg)
DIFFERENCES BETWEEN EULER PATH AND EULER CIRCUIT
Euler Path-starts and ends at different
vertices. Euler circuit- when a Euler path
begins and ends at the same vertex
![Page 8: Slide task 6](https://reader035.vdocuments.mx/reader035/viewer/2022062514/55855637d8b42a54608b4dfb/html5/thumbnails/8.jpg)
STEP BY STEP TO DETERMINE EULER PATH AND EULER CIRCUIT
There are two odd vertices, A and F. Let's start at F.
![Page 9: Slide task 6](https://reader035.vdocuments.mx/reader035/viewer/2022062514/55855637d8b42a54608b4dfb/html5/thumbnails/9.jpg)
Start walking at F. When you use an edge, delete it.
![Page 10: Slide task 6](https://reader035.vdocuments.mx/reader035/viewer/2022062514/55855637d8b42a54608b4dfb/html5/thumbnails/10.jpg)
![Page 11: Slide task 6](https://reader035.vdocuments.mx/reader035/viewer/2022062514/55855637d8b42a54608b4dfb/html5/thumbnails/11.jpg)
![Page 12: Slide task 6](https://reader035.vdocuments.mx/reader035/viewer/2022062514/55855637d8b42a54608b4dfb/html5/thumbnails/12.jpg)
![Page 13: Slide task 6](https://reader035.vdocuments.mx/reader035/viewer/2022062514/55855637d8b42a54608b4dfb/html5/thumbnails/13.jpg)
![Page 14: Slide task 6](https://reader035.vdocuments.mx/reader035/viewer/2022062514/55855637d8b42a54608b4dfb/html5/thumbnails/14.jpg)
Path so far: FEACB
![Page 15: Slide task 6](https://reader035.vdocuments.mx/reader035/viewer/2022062514/55855637d8b42a54608b4dfb/html5/thumbnails/15.jpg)
Path so far: FEACBD.
![Page 16: Slide task 6](https://reader035.vdocuments.mx/reader035/viewer/2022062514/55855637d8b42a54608b4dfb/html5/thumbnails/16.jpg)
![Page 17: Slide task 6](https://reader035.vdocuments.mx/reader035/viewer/2022062514/55855637d8b42a54608b4dfb/html5/thumbnails/17.jpg)
Path so far: FEACBDC
![Page 18: Slide task 6](https://reader035.vdocuments.mx/reader035/viewer/2022062514/55855637d8b42a54608b4dfb/html5/thumbnails/18.jpg)
Path so far: FEACBDC Now we have to cross the bridge CF.
![Page 19: Slide task 6](https://reader035.vdocuments.mx/reader035/viewer/2022062514/55855637d8b42a54608b4dfb/html5/thumbnails/19.jpg)
![Page 20: Slide task 6](https://reader035.vdocuments.mx/reader035/viewer/2022062514/55855637d8b42a54608b4dfb/html5/thumbnails/20.jpg)
![Page 21: Slide task 6](https://reader035.vdocuments.mx/reader035/viewer/2022062514/55855637d8b42a54608b4dfb/html5/thumbnails/21.jpg)
![Page 22: Slide task 6](https://reader035.vdocuments.mx/reader035/viewer/2022062514/55855637d8b42a54608b4dfb/html5/thumbnails/22.jpg)
![Page 23: Slide task 6](https://reader035.vdocuments.mx/reader035/viewer/2022062514/55855637d8b42a54608b4dfb/html5/thumbnails/23.jpg)
WHAT DO YOU UNDERSTAND ABOUT:
Hamilton PathHamilton Circuit
![Page 24: Slide task 6](https://reader035.vdocuments.mx/reader035/viewer/2022062514/55855637d8b42a54608b4dfb/html5/thumbnails/24.jpg)
DEFINITION AND EXAMPLE OF HAMILTON PATH
Definition: a directed path that goes through each vertex exactly once
![Page 25: Slide task 6](https://reader035.vdocuments.mx/reader035/viewer/2022062514/55855637d8b42a54608b4dfb/html5/thumbnails/25.jpg)
DEFINITION AND EXAMPLE OF HAMILTON CIRCUIT
is a circuit (a path that ends where it starts) that visits each vertex once without touching any vertex more than once. There may be more than one Hamilton path for a graph
![Page 26: Slide task 6](https://reader035.vdocuments.mx/reader035/viewer/2022062514/55855637d8b42a54608b4dfb/html5/thumbnails/26.jpg)
DIFFERENCES BETWEEN HAMILTON PATH AND HAMILTON CIRCUIT
Hamilton PathA path must have beginning and ending.
Hamilton CircuitDoes not have beginning / start & end is
same.
![Page 27: Slide task 6](https://reader035.vdocuments.mx/reader035/viewer/2022062514/55855637d8b42a54608b4dfb/html5/thumbnails/27.jpg)
STEP BY STEP TO DETERMINE HAMILTON PATH AND CIRCUIT
a b
cd
![Page 28: Slide task 6](https://reader035.vdocuments.mx/reader035/viewer/2022062514/55855637d8b42a54608b4dfb/html5/thumbnails/28.jpg)
a
b
cd
e