by meli & amy & meggie & bex. what is route inspection hmmmm??? objective: is to go...
DESCRIPTION
How To Do A Route InspectionTRANSCRIPT
![Page 1: By Meli & Amy & Meggie & Bex. What is route inspection hmmmm??? Objective: Is to go along every single edge and end up back to where you started from](https://reader036.vdocuments.us/reader036/viewer/2022070606/5a4d1b617f8b9ab0599ad90c/html5/thumbnails/1.jpg)
By Meli & Amy & Meggie & Bex
![Page 2: By Meli & Amy & Meggie & Bex. What is route inspection hmmmm??? Objective: Is to go along every single edge and end up back to where you started from](https://reader036.vdocuments.us/reader036/viewer/2022070606/5a4d1b617f8b9ab0599ad90c/html5/thumbnails/2.jpg)
What is route inspection hmmmm???
Objective: Is to go along every single edge and end up back to where you started from.
Aim: Is to find the quickest route from a given starting point.
REMEMBER route inspection only works if the graph is “Eulerian”
![Page 3: By Meli & Amy & Meggie & Bex. What is route inspection hmmmm??? Objective: Is to go along every single edge and end up back to where you started from](https://reader036.vdocuments.us/reader036/viewer/2022070606/5a4d1b617f8b9ab0599ad90c/html5/thumbnails/3.jpg)
How To Do A How To Do A Route InspectionRoute Inspection
![Page 4: By Meli & Amy & Meggie & Bex. What is route inspection hmmmm??? Objective: Is to go along every single edge and end up back to where you started from](https://reader036.vdocuments.us/reader036/viewer/2022070606/5a4d1b617f8b9ab0599ad90c/html5/thumbnails/4.jpg)
Step 1 Note Down All The Odd Vertices
Odd Vertices => B, D, E, F
3
3
5
1 7
4
426
71
3
1
23
1
4
23
1
34
23
1
5
34
23
1
65
34
23
1 7
65
34
23
1
4
7
65
34
23
1
![Page 5: By Meli & Amy & Meggie & Bex. What is route inspection hmmmm??? Objective: Is to go along every single edge and end up back to where you started from](https://reader036.vdocuments.us/reader036/viewer/2022070606/5a4d1b617f8b9ab0599ad90c/html5/thumbnails/5.jpg)
Step 2 & 3 Pair Up Odd Vertices
BE – 5
(Find the shortest routes)
Don’t forget there might be more than one
different way of getting from 1 letter to another. Make sure to check all
the different ways
4
7
65
34
23
1
BD – 6
BF – 2DE – 3DF – 7EF – 4
BD + EF = 10
BE + DF = 12
BF + DE = 5
![Page 6: By Meli & Amy & Meggie & Bex. What is route inspection hmmmm??? Objective: Is to go along every single edge and end up back to where you started from](https://reader036.vdocuments.us/reader036/viewer/2022070606/5a4d1b617f8b9ab0599ad90c/html5/thumbnails/6.jpg)
Step 4 Add up all the weights on the graph
Total Weights => 1 + 7 + 4 + 3 + 4 + 3 + 2 + 5 + 6 = 35
4
7
65
34
23
1
![Page 7: By Meli & Amy & Meggie & Bex. What is route inspection hmmmm??? Objective: Is to go along every single edge and end up back to where you started from](https://reader036.vdocuments.us/reader036/viewer/2022070606/5a4d1b617f8b9ab0599ad90c/html5/thumbnails/7.jpg)
Step 5 Add on repeated edges
35 + 5 = 40
4
7
65
34
23
1
3
22
![Page 8: By Meli & Amy & Meggie & Bex. What is route inspection hmmmm??? Objective: Is to go along every single edge and end up back to where you started from](https://reader036.vdocuments.us/reader036/viewer/2022070606/5a4d1b617f8b9ab0599ad90c/html5/thumbnails/8.jpg)
Step 6 State A Route
4
7
65
34
23
1
2
3
Example:
FABEFBCDEBD
![Page 9: By Meli & Amy & Meggie & Bex. What is route inspection hmmmm??? Objective: Is to go along every single edge and end up back to where you started from](https://reader036.vdocuments.us/reader036/viewer/2022070606/5a4d1b617f8b9ab0599ad90c/html5/thumbnails/9.jpg)
Practise Questions1. Below is the shape of a university campus. Each building is given a letter. As you can see there is the distance between each building written on the diagram. Using route inspection find out the shortest route, starting at A.
67
25
89
3712
42
7
9630
55
40
10
90
A
B
D
C
E
F
G
I
H
22
![Page 10: By Meli & Amy & Meggie & Bex. What is route inspection hmmmm??? Objective: Is to go along every single edge and end up back to where you started from](https://reader036.vdocuments.us/reader036/viewer/2022070606/5a4d1b617f8b9ab0599ad90c/html5/thumbnails/10.jpg)
1. Odd vertices are BCDFGH,BC=37 CD=42 DF=70 FG=25 GH=32BD=79 CF=52 DG=52 FH=50BF=95 CG= 34 DH=40BG=77 CH=22BH=65BC+DF+GH= 37+70+32=139BD+CH+FG= 79+22+25=126BF+CG+DH= 95+34+40=169BG+CD+FH= 77+42+50=169BH+CF+DG=65+52+52= 169
Practise question answers
67
25
89
3712
42
7
9630
55
40
10
90
A
B
D
C
E
F
G
I
H
22
Total of all weights= 622
Repeated edges = 126748 and a possible route = ABICBDCHIDEFIGFGHA
![Page 11: By Meli & Amy & Meggie & Bex. What is route inspection hmmmm??? Objective: Is to go along every single edge and end up back to where you started from](https://reader036.vdocuments.us/reader036/viewer/2022070606/5a4d1b617f8b9ab0599ad90c/html5/thumbnails/11.jpg)
Practise Questions continued…2. Use route inspection to solve this problem:
11B
C
D
A
EF
12
1418
13
12
18
15
19
17
10
![Page 12: By Meli & Amy & Meggie & Bex. What is route inspection hmmmm??? Objective: Is to go along every single edge and end up back to where you started from](https://reader036.vdocuments.us/reader036/viewer/2022070606/5a4d1b617f8b9ab0599ad90c/html5/thumbnails/12.jpg)
Practise Question answer2. Odd vertices are ACEF
AC=24 CE=13 EF=10AE=11 CF=23AF=19AC+EF=24+10=34AE+CF=11+23=34AF+CE=19+13=32
Total of all edges = 159Repeated edges = 32
11B
C
D
A
EF
12
1418
13
12
18
15
19
17
10
191
![Page 13: By Meli & Amy & Meggie & Bex. What is route inspection hmmmm??? Objective: Is to go along every single edge and end up back to where you started from](https://reader036.vdocuments.us/reader036/viewer/2022070606/5a4d1b617f8b9ab0599ad90c/html5/thumbnails/13.jpg)