Getting Started &. How often do you feel like this as a mathematics teacher?
Chapter 5: The Mathematics of Getting Aroundrimmer/math170/notes/un… · · 2013-10-2110/21/2013...
Transcript of Chapter 5: The Mathematics of Getting Aroundrimmer/math170/notes/un… · · 2013-10-2110/21/2013...
10/21/2013
1
Chapter 5:The Mathematics
of Getting Around
5.3 Euler’s Theorems and Fleury’s Algorithm
Excursions in Modern Mathematics, 7e: 1.1 - 2Copyright © 2010 Pearson Education, Inc.Copyright © 2014 Pearson Education. All rights reserved. 5.3-2
In this section we are going to develop the basic
theory that will allow us to determine if a graph has
an Euler circuit, an Euler path, or neither. This is
important because, as we saw in the previous
section, what are Euler circuit or Euler path questions
in theory are real-life routing questions in practice. The
three theorems we are going to see next (all thanks
to Euler) are surprisingly simple and yet tremendously
useful.
Euler’s Theorems
Excursions in Modern Mathematics, 7e: 1.1 - 3Copyright © 2010 Pearson Education, Inc.Copyright © 2014 Pearson Education. All rights reserved. 5.3-3
■ If a graph is connected and every vertex is even, then it has an Euler circuit (at least one, usually more).■ If a graph has any odd vertices, then it does not have an Euler circuit.
EULER’S CIRCUIT THEOREM
Excursions in Modern Mathematics, 7e: 1.1 - 4Copyright © 2010 Pearson Education, Inc.Copyright © 2014 Pearson Education. All rights reserved. 5.3-4
Here is how we can use Euler’s circuit theorem. First
we make sure the graph is connected. (If it isn’t, then
no matter what else, an Euler circuit is impossible.) If
the graph is connected, then we start checking the
degrees of the vertices, one by one. As soon as we hit
an odd vertex, we know that an Euler circuit is out of
the question. If there are no odd vertices, then we
know that the answer is yes–the graph does have an
Euler circuit!
How to Use the Theorem
Excursions in Modern Mathematics, 7e: 1.1 - 5Copyright © 2010 Pearson Education, Inc.Copyright © 2014 Pearson Education. All rights reserved. 5.3-5
Figure 5-15 illustrates the three possible scenarios. The graph in Fig. 5-15(a) cannot
Illustration using the Theorem
have an Euler circuit for the simple reason that it is disconnected.
Fig. 5-15(a)
Excursions in Modern Mathematics, 7e: 1.1 - 6Copyright © 2010 Pearson Education, Inc.Copyright © 2014 Pearson Education. All rights reserved. 5.3-6
The graph in Fig. 5-15(b) is connected, but we can quickly spot odd vertices (C is one
Illustration using the Theorem
of them; there are others). This graph has no Euler circuits.
Fig. 5-15(b)
10/21/2013
2
Excursions in Modern Mathematics, 7e: 1.1 - 7Copyright © 2010 Pearson Education, Inc.Copyright © 2014 Pearson Education. All rights reserved. 5.3-7
But the graph in Fig. 5-15(c) is connected and all the vertices are even. This graph
Illustration using the Theorem
does have Euler circuits.
Fig. 5-15(c)
Excursions in Modern Mathematics, 7e: 1.1 - 8Copyright © 2010 Pearson Education, Inc.Copyright © 2014 Pearson Education. All rights reserved. 5.3-8
The basic idea behind Euler’s circuit theorem is that
as we travel along an Euler circuit, every time we go
through a vertex we use up two different edges at
that vertex–one to come in and one to go out. We
can keep doing this as long as the vertices are even.
A single odd vertex means that at some point we are
going to come into it and not be able to get out.
Summary of the Theorem
Excursions in Modern Mathematics, 7e: 1.1 - 9Copyright © 2010 Pearson Education, Inc.Copyright © 2014 Pearson Education. All rights reserved. 5.3-9
■ If a graph is connected and has exactly two odd vertices, then it has an Euler path (at least one, usually more). Any such path must start at one of the odd vertices and end at the other one.■ If a graph has more than two odd vertices, then it cannot have an Euler path.
EULER’S PATH THEOREMExcursions in Modern Mathematics, 7e: 1.1 - 10Copyright © 2010 Pearson Education, Inc.Copyright © 2014 Pearson Education. All rights reserved. 5.3-10
Back to the Königsberg bridges problem. In Example 5.15 we saw that the layout of the
Example 5.18 The Seven Bridges of Königsberg: Part 3
bridges in the old city can be modeled by the graph in Fig. 5-16(a). This graph has four odd vertices; thus, neither an Euler circuit nor an Euler path can exist.
Fig. 5-16
Excursions in Modern Mathematics, 7e: 1.1 - 11Copyright © 2010 Pearson Education, Inc.Copyright © 2014 Pearson Education. All rights reserved. 5.3-11
We now have an unequivocal answer to the puzzle:
There is no possible way anyone can walk across all
the bridges without having to re-cross some of them!
How many bridges will need to be re-crossed?
It depends. If we want to start and end in the same
place, we must re-cross at least two of the bridges.
Example 5.18 The Seven Bridges of Königsberg: Part 3
Excursions in Modern Mathematics, 7e: 1.1 - 12Copyright © 2010 Pearson Education, Inc.Copyright © 2014 Pearson Education. All rights reserved. 5.3-12
One of the many possible routes is shown in
Example 5.18 The Seven Bridges of Königsberg: Part 3
Fig. 5-16(b). In this
route the bridge
connecting L and D is
crossed twice, and
so is one of the two
bridges connecting A
and R.
Fig. 5-16(b)
10/21/2013
3
Excursions in Modern Mathematics, 7e: 1.1 - 13Copyright © 2010 Pearson Education, Inc.Copyright © 2014 Pearson Education. All rights reserved. 5.3-13
If we are allowed to start and end in different
Example 5.18 The Seven Bridges of Königsberg: Part 3
places, we can do it by
Re-crossing just one of
the bridges. One
possible route starting
at A, crossing bridge LD
twice, and ending at R
is shown in Fig.5-16(c).
Fig. 5-15(c)
Excursions in Modern Mathematics, 7e: 1.1 - 14Copyright © 2010 Pearson Education, Inc.Copyright © 2014 Pearson Education. All rights reserved. 5.3-14
Example 5.19 Child’s Play: Part 2The graph in Fig. 5-17(a) is
connected, and the
vertices are all even. By
Euler’s circuit theorem we
know that the graph has
an Euler circuit, which
implies that the original line
drawing has a closed
unicursal tracing.
Fig. 5-17(a)
Excursions in Modern Mathematics, 7e: 1.1 - 15Copyright © 2010 Pearson Education, Inc.Copyright © 2014 Pearson Education. All rights reserved. 5.3-15
Example 5.19 Child’s Play: Part 2The graph in Fig. 5-17(b) is
connected and has exactly
two odd vertices (C and
D). By Euler’s path theorem,
the graph has an Euler path
(open unicursal tracing).
Moreover, we now know
that the path has to start at
C and end at D, or vice
versa.Fig. 5-17(b)
Excursions in Modern Mathematics, 7e: 1.1 - 16Copyright © 2010 Pearson Education, Inc.Copyright © 2014 Pearson Education. All rights reserved. 5.3-16
Example 5.19 Child’s Play: Part 2The graph in Fig.
5-17(c) has four
odd vertices (A,
B, C, and D), so it
has neither an
Euler path nor an
Euler circuit.
Fig. 5-17(c)
Excursions in Modern Mathematics, 7e: 1.1 - 17Copyright © 2010 Pearson Education, Inc.Copyright © 2014 Pearson Education. All rights reserved. 5.3-17
The full power of Euler’s theorems is best appreciated when the graphs get bigger.
Example 5.19 Child’’’’s Play: Part 2The graph in Fig.
5-17(d) is not
extremely big,
but we can no
longer “eyeball”
an Euler circuit or
path.
Fig. 5-17(d)
Excursions in Modern Mathematics, 7e: 1.1 - 18Copyright © 2010 Pearson Education, Inc.Copyright © 2014 Pearson Education. All rights reserved. 5.3-18
On the other hand, a quick check of the degrees of the
vertices shows that K and I are odd vertices and all the
rest are even. We are
Example 5.19 Child’s Play: Part 2now in business–an
open unicursal
tracing is possible as
long as we start it at
K or I (and end it at
the other one).
Starting anyplace
else will lead to a
dead end. Good to
know!
10/21/2013
4
Excursions in Modern Mathematics, 7e: 1.1 - 19Copyright © 2010 Pearson Education, Inc.Copyright © 2014 Pearson Education. All rights reserved. 5.3-19
Euler’s circuit theorem deals with graphs with zero
odd vertices, whereas Euler’s Path Theorem deals
with graphs with two or more odd vertices. The only
scenario not covered by the two theorems is that of
graphs with just one odd vertex. Euler’s third theorem
rules out this possibility–a graph cannot have just one
odd vertex. In fact, Euler’s third theorem says much
more.
Euler’s Third TheoremExcursions in Modern Mathematics, 7e: 1.1 - 20Copyright © 2010 Pearson Education, Inc.Copyright © 2014 Pearson Education. All rights reserved. 5.3-20
■ The sum of the degrees of all the vertices of a graph equals twice the number of edges (and therefore is an even number).■ A graph always has an even number of odd vertices.
EULER’S SUM OF DEGREES THEOREM
Excursions in Modern Mathematics, 7e: 1.1 - 21Copyright © 2010 Pearson Education, Inc.Copyright © 2014 Pearson Education. All rights reserved. 5.3-21
Euler’s sum of degrees theorem is based on the
following basic observation: Take any edge–let’s call
it XY. The edge contributes once to the degree of
vertex X and once to the degree of vertex Y, so, in all,
that edge makes a total contribution of 2 to the sum
of the degrees. Thus, when the degrees of all the
vertices of a graph are added, the total is twice the
number of edges.
Euler’s Sum of Degrees TheoremExcursions in Modern Mathematics, 7e: 1.1 - 22Copyright © 2010 Pearson Education, Inc.Copyright © 2014 Pearson Education. All rights reserved. 5.3-22
Since the total sum is an even number, it is impossible
to have just one odd vertex, or three odd vertices, or
five odd vertices, and so on. To put it in a slightly
different way, the odd vertices of a graph always
come in twos. Table 5-1is a summary of Euler’s three
theorems. It shows the relationship between the
number of odd vertices in a connected graph G and
the existence of Euler paths or Euler circuits.
Euler’s Sum of Degrees Theorem
Excursions in Modern Mathematics, 7e: 1.1 - 23Copyright © 2010 Pearson Education, Inc.Copyright © 2014 Pearson Education. All rights reserved. 5.3-23
Euler’s Sum of Degrees TheoremExcursions in Modern Mathematics, 7e: 1.1 - 24Copyright © 2010 Pearson Education, Inc.Copyright © 2014 Pearson Education. All rights reserved. 5.3-24
When the graph has an Euler circuit or path, how do
we find it? For small graphs, simple trial-and-error
usually works fine, but real-life applications sometimes
involve graphs with hundreds, or even thousands, of
vertices. In these cases a trial-and-error approach is
out of the question, and what is needed is a
systematic strategy that tells us how to create an
Euler circuit or path. In other words, we need an
algorithm.
Algorithms
10/21/2013
5
Excursions in Modern Mathematics, 7e: 1.1 - 25Copyright © 2010 Pearson Education, Inc.Copyright © 2014 Pearson Education. All rights reserved. 5.3-25
There are many types of problems that can be solved
by simply following a set of procedural rules–very
specific rules like when you get to this point, do this, ...
after you finish this, do that, and so on. Given a
specific problem X, an algorithm for solving X is a set
of procedural rules that, when followed, always lead
to some sort of “solution” to X. X need not be a
mathematics problem–algorithms are used,
sometimes unwittingly, in all walks of life:
Algorithms
Excursions in Modern Mathematics, 7e: 1.1 - 26Copyright © 2010 Pearson Education, Inc.Copyright © 2014 Pearson Education. All rights reserved. 5.3-26
directions to find someone’s house, the instructions for
assembling a new bike, or a recipe for baking an
apple pie are all examples of real-life algorithms. A
useful analogy is to think of the problem as a dish we
want to prepare and the algorithm as a recipe for
preparing that dish. In mathematics, algorithms are
either formula driven (you just apply the formula or
formulas to the appropriate inputs) or directive driven
(you must follow a specific set of directives).
Algorithms
Excursions in Modern Mathematics, 7e: 1.1 - 27Copyright © 2010 Pearson Education, Inc.Copyright © 2014 Pearson Education. All rights reserved. 5.3-27
We will now turn our attention to an algorithm that
finds an Euler circuit or an Euler path in a connected
graph. Technically speaking, these are two separate
algorithms, but in essence they are identical, so they
can be described as one.
The idea behind Fleury’s algorithm can be
paraphrased by that old piece of folk wisdom: Don’t
burn your bridges behind you.
Fleury’s AlgorithmExcursions in Modern Mathematics, 7e: 1.1 - 28Copyright © 2010 Pearson Education, Inc.Copyright © 2014 Pearson Education. All rights reserved. 5.3-28
In graph theory the word bridge has a very specific meaning–it is the only edge connecting two separate sections (call them long as we start it at K or I (and end it at the other one). Starting anyplace else will lead to a dead end. Good to know!
Fleury’s Algorithm
Excursions in Modern Mathematics, 7e: 1.1 - 29Copyright © 2010 Pearson Education, Inc.Copyright © 2014 Pearson Education. All rights reserved. 5.3-29
Thus, Fleury’s algorithm is based on a simple principle:
To find an Euler circuit or an Euler path, bridges are
the last edges you want to cross. Our concerns lie
only on how we are going to get around the yet-to-
be-traveled part of the graph. Thus, when we talk
about bridges that we want to leave as a last
resort, we are really referring to bridges of the to-be-
traveled part of the graph.
Fleury’s AlgorithmExcursions in Modern Mathematics, 7e: 1.1 - 30Copyright © 2010 Pearson Education, Inc.Copyright © 2014 Pearson Education. All rights reserved. 5.3-30
■ Preliminaries.Make sure that the graph is connected and either (1) has no odd vertices (circuit) or (2) has just two odd vertices (path).■ Start. Choose a starting vertex. [In case (1) this can be any vertex; in case (2) it must be one of the two odd vertices.]
FLEURY’S ALGORITHM FOR FINDING AN EULER CIRCUIT (PATH)
10/21/2013
6
Excursions in Modern Mathematics, 7e: 1.1 - 31Copyright © 2010 Pearson Education, Inc.Copyright © 2014 Pearson Education. All rights reserved. 5.3-31
■ Intermediate steps. At each step, if you have a choice, don’t choose a bridge of the yet-to-be-traveled part of the graph. However, if you have only one choice, take it.■ End.When you can’t travel any more, the circuit (path) is complete. [In case (1) you will be back at the starting vertex; in case (2) you will end at the other odd vertex.]
FLEURY’S ALGORITHM FOR FINDING AN EULER CIRCUIT (PATH)
Excursions in Modern Mathematics, 7e: 1.1 - 32Copyright © 2010 Pearson Education, Inc.Copyright © 2014 Pearson Education. All rights reserved. 5.3-32
In implementing Fleury’s algorithm it is critical to
separate the past (the part of the graph that has
already been traveled) from the future (the part of
the graph that still needs to be traveled). While there
are many different ways to accomplish this (you are
certainly encouraged to come up with one of your
own), a fairly reliable way goes like this: Start with two
copies of the graph. Copy 1 is to keep track of the
“future”; copy 2 is to keep track of the “past.”Fleury’s Algorithm Bookkeeping
Excursions in Modern Mathematics, 7e: 1.1 - 33Copyright © 2010 Pearson Education, Inc.Copyright © 2014 Pearson Education. All rights reserved. 5.3-33
Every time you travel along an edge, erase the edge
from copy 1, but mark it (say in red) and label it with
the appropriate number on copy 2. As you move
forward, copy 1 gets smaller and copy 2 gets redder.
At the end, copy 1 has disappeared; copy 2 shows
the actual Euler circuit or path.
Fleury’s Algorithm BookkeepingExcursions in Modern Mathematics, 7e: 1.1 - 34Copyright © 2010 Pearson Education, Inc.Copyright © 2014 Pearson Education. All rights reserved. 5.3-34
The graph in Fig. 5-19(a) is a very simple graph – it
would be easier to find an Euler circuit just by trial-
and-error than by using Fleury’s algorithm.
Nonetheless, we will do it using Fleury’s algorithm. The
real purpose of the example is to
Example 5.20 Implementing Fleury’s Algorithm
see the algorithm at
work. Each step of the
algorithm is explained in Figs.
5-19(b) through (h).
Fig. 5-19(a)
Excursions in Modern Mathematics, 7e: 1.1 - 35Copyright © 2010 Pearson Education, Inc.Copyright © 2014 Pearson Education. All rights reserved. 5.3-35
Start:We can pick any starting point we want. Let’s say we start at F.
Example 5.20 Implementing Fleury’s AlgorithmFig. 5-19(b)
Excursions in Modern Mathematics, 7e: 1.1 - 36Copyright © 2010 Pearson Education, Inc.Copyright © 2014 Pearson Education. All rights reserved. 5.3-36
Step 1: Travel from F to C. (Could have also gone from Fto D.)
Example 5.20 Implementing Fleury’s AlgorithmFig. 5-19(c)
10/21/2013
7
Excursions in Modern Mathematics, 7e: 1.1 - 37Copyright © 2010 Pearson Education, Inc.Copyright © 2014 Pearson Education. All rights reserved. 5.3-37
Step 2: Travel from C to D. (Could have also gone to Aor to E.)
Example 5.20 Implementing Fleury’s AlgorithmFig. 5-19(d)
Excursions in Modern Mathematics, 7e: 1.1 - 38Copyright © 2010 Pearson Education, Inc.Copyright © 2014 Pearson Education. All rights reserved. 5.3-38
Step 3: Travel from D to A. (Could have also gone to Bbut not to F – DF is a bridge!)
Example 5.20 Implementing Fleury’s Algorithm
Fig. 5-19(e)
Excursions in Modern Mathematics, 7e: 1.1 - 39Copyright © 2010 Pearson Education, Inc.Copyright © 2014 Pearson Education. All rights reserved. 5.3-39
Step 4: Travel from A to C. (Could have also gone to Ebut not to B – AB is a bridge!)
Example 5.20 Implementing Fleury’s Algorithm
Fig. 5-19(f)Excursions in Modern Mathematics, 7e: 1.1 - 40Copyright © 2010 Pearson Education, Inc.Copyright © 2014 Pearson Education. All rights reserved. 5.3-40
Step 5: Travel from C to E. (There is no choice!)
Example 5.20 Implementing Fleury’s AlgorithmFig. 5-19(g)
Excursions in Modern Mathematics, 7e: 1.1 - 41Copyright © 2010 Pearson Education, Inc.Copyright © 2014 Pearson Education. All rights reserved. 5.3-41
Steps 6, 7, 8, and 9:
Only one way to goat each step.
Example 5.20 Implementing Fleury’s Algorithm
Fig. 5-19(h)
Excursions in Modern Mathematics, 7e: 1.1 - 42Copyright © 2010 Pearson Education, Inc.Copyright © 2014 Pearson Education. All rights reserved. 5.3-42
We will apply Fleury’s algorithm to the graph in Fig. 5-20.
Example 5.21 Fleury’s Algorithm for Euler Paths
Fig. 5-20
10/21/2013
8
Excursions in Modern Mathematics, 7e: 1.1 - 43Copyright © 2010 Pearson Education, Inc.Copyright © 2014 Pearson Education. All rights reserved. 5.3-43
Since it would be a little impractical to show each step
of the algorithm with a separate picture as we did in
Example 5.20, you are going to have to do some of the
work. Start by making two copies of the graph.
Example 5.21 Fleury’s Algorithm for Euler Paths
■ Start. This graph has two odd vertices, E and J. We can pick either one as the starting vertex. Let’s start at J.
Excursions in Modern Mathematics, 7e: 1.1 - 44Copyright © 2010 Pearson Education, Inc.Copyright © 2014 Pearson Education. All rights reserved. 5.3-44
■ Step 1. From J we have five choices, all of which are OK. We’ll randomly pick K. (Erase JK on copy 1, and mark and label JK with a 1 on copy 2.)
Example 5.21 Fleury’s Algorithm for Euler Paths
■ Step 2. From K we have three choices (B, L, or H). Any of these choices is OK. Say we choose B. (Now erase KB from copy 1 and mark and label KBwith a 2 on copy 2.)
Excursions in Modern Mathematics, 7e: 1.1 - 45Copyright © 2010 Pearson Education, Inc.Copyright © 2014 Pearson Education. All rights reserved. 5.3-45
■ Step 3. From B we have three choices (A, C, or J). Any of these choices is OK. Say we choose C. (Now erase BC from copy 1 and mark and label BC with a 3 on copy 2.)
Example 5.21 Fleury’s Algorithm for Euler Paths
■ Step 4. From C we have three choices (D, E, or L). Any of these choices is OK. Say we choose L. (EML–that’s shorthand for erase, mark, and label.)
Excursions in Modern Mathematics, 7e: 1.1 - 46Copyright © 2010 Pearson Education, Inc.Copyright © 2014 Pearson Education. All rights reserved. 5.3-46
■ Step 5. From L we have three choices (E, G, or K). Any of these choices is OK. Say we choose K. (EML.)
Example 5.21 Fleury’s Algorithm for Euler Paths
■ Step 6. From K we have only one choice– to H. We choose H. (EML.)
Excursions in Modern Mathematics, 7e: 1.1 - 47Copyright © 2010 Pearson Education, Inc.Copyright © 2014 Pearson Education. All rights reserved. 5.3-47
■ Step 7. From H we have three choices (G, I, or J).
Example 5.21 Fleury’s Algorithm for Euler Paths
We should not
choose G, as HG is
a bridge of the yet-
to-be-traveled part
of the graph (see
Fig. 5-21).
Fig. 5-21
Excursions in Modern Mathematics, 7e: 1.1 - 48Copyright © 2010 Pearson Education, Inc.Copyright © 2014 Pearson Education. All rights reserved. 5.3-48
■ Step 7. Either of the other two choices is OK.
Example 5.21 Fleury’s Algorithm for Euler Paths
Say we choose J. (EML.)
10/21/2013
9
Excursions in Modern Mathematics, 7e: 1.1 - 49Copyright © 2010 Pearson Education, Inc.Copyright © 2014 Pearson Education. All rights reserved. 5.3-49
■ Step 8. From J we have three choices (A, B, or I), but we should not choose I, as JI has just become a bridge. Either of the other two choices is OK. Say we choose B. (EML)
Example 5.21 Fleury’s Algorithm for Euler Paths
■ Step 9 through 13. Each time we have only one choice. From B we have to go to A, then to J, I, H, and G.
Excursions in Modern Mathematics, 7e: 1.1 - 50Copyright © 2010 Pearson Education, Inc.Copyright © 2014 Pearson Education. All rights reserved. 5.3-50
■ Step 14 through 21. Not to belabor the point, let’s just cut to the chase. The rest of the path is given by G, F, E, D, C, E, G, L, E. There are many possible endings, and you should find a different one by yourself.
Example 5.21 Fleury’s Algorithm for Euler Paths
The completed Euler path (one of hundreds of possible ones) is shown in Fig. 5-22.
Excursions in Modern Mathematics, 7e: 1.1 - 51Copyright © 2010 Pearson Education, Inc.Copyright © 2014 Pearson Education. All rights reserved. 5.3-51
Example 5.21 Fleury’s Algorithm for Euler Paths
Fig. 5-22
Excursions in Modern Mathematics, 7e: 1.1 - 52Copyright © 2010 Pearson Education, Inc.Copyright © 2014 Pearson Education. All rights reserved. 5.3-52
Chapter 5:The Mathematics
of Getting Around
5.4 Eulerizing and Semi to Eulerizing Graphs
Excursions in Modern Mathematics, 7e: 1.1 - 53Copyright © 2010 Pearson Education, Inc.Copyright © 2014 Pearson Education. All rights reserved. 5.3-53
In this section we will finally answer some of the
routing problems raised at the beginning of the
chapter. Their common thread is the need to find
optimal exhaustive routes in a connected graph. How
is this done? Let’s first refresh our memories of what
this means. We will use the term exhaustive route to
describe a route that travels along the edges of a
graph and passes through each and every edge of
the graph at least once.
Exhaustive Routes
Excursions in Modern Mathematics, 7e: 1.1 - 54Copyright © 2010 Pearson Education, Inc.Copyright © 2014 Pearson Education. All rights reserved. 5.3-54
Such a route could be an Euler circuit (if the graph
has no odd vertices) or an Euler path (if the graph has
two odd vertices), but for graphs with more than two
odd vertices, an exhaustive route will have to recross
some of the edges. This follows from Euler’s theorems.
We are interested in finding exhaustive routes that
recross the fewest number of edges. Why?
Exhaustive Routes
10/21/2013
10
Excursions in Modern Mathematics, 7e: 1.1 - 55Copyright © 2010 Pearson Education, Inc.Copyright © 2014 Pearson Education. All rights reserved. 5.3-55
In many applications, each edge represents a unit of
cost. The more edges along the route, the higher the
cost of the route. In an exhaustive route, the first pass
along an edge is a necessary expense, part of the
requirements of the job. Any additional pass along
that edge represents a wasted expense (these extra
passes are often described as deadhead travel).
Thus, an exhaustive route that minimizes cost (optimal
exhaustive route) is one with the fewest number of
deadhead edges.
Exhaustive Routes
Excursions in Modern Mathematics, 7e: 1.1 - 56Copyright © 2010 Pearson Education, Inc.Copyright © 2014 Pearson Education. All rights reserved. 5.3-56
We are now going to see how the theory developed
in the preceding sections will help us design optimal
exhaustive routes for graphs with many (more than
two) odd vertices. The key idea is that we can turn
odd vertices into even vertices by adding “duplicate”
edges in strategic places. This process is called
eulerizing the graph.
Eulerizing Graphs
Excursions in Modern Mathematics, 7e: 1.1 - 57Copyright © 2010 Pearson Education, Inc.Copyright © 2014 Pearson Education. All rights reserved. 5.3-57
The graph represents a 3 block by 3 block street grid
consisting of 24 blocks. How can we find an optimal
route that covers all the edges
Example 5.22 Covering a 3 by 3 Street Grid
of the graph and ends
back at the starting
vertex? Our first step is to
identify the odd vertices.
This graph has eight odd
vertices (B, C, E, F, H, I, K,
and L), shown in red.
Excursions in Modern Mathematics, 7e: 1.1 - 58Copyright © 2010 Pearson Education, Inc.Copyright © 2014 Pearson Education. All rights reserved. 5.3-58
When we add a duplicate copy of edges BC, EF, HI,
and KL, we get this graph. This is a eulerized version of
the original graph–its
Example 5.22 Covering a 3 by 3 Street Grid
vertices are all even, so we
know it has an Euler circuit.
Moreover, it’s clear we
couldn’t have done this with
fewer than four duplicate
edges
Excursions in Modern Mathematics, 7e: 1.1 - 59Copyright © 2010 Pearson Education, Inc.Copyright © 2014 Pearson Education. All rights reserved. 5.3-59
This figure shows one of the many possible Euler circuits,
with the edges numbered in the order they are
traveled. The Euler circuit represents an exhaustive
closed route along
Example 5.22 Covering a 3 by 3 Street Grid
the edges of the original
graph, with the four
duplicate edges (BC, EF, HI,
and KL) indicating the
deadhead blocks where a
second pass is required.
Excursions in Modern Mathematics, 7e: 1.1 - 60Copyright © 2010 Pearson Education, Inc.Copyright © 2014 Pearson Education. All rights reserved. 5.3-60
The total length of this route is 28 blocks (24 blocks in the
grid plus 4 deadhead blocks), and this route is optimal–
no matter how clever you are or how hard you try, if
Example 5.22 Covering a 3 by 3 Street Grid
you want to travel along
each block of the grid and
start and end at the same
vertex, you will have to
pass through a minimum of
28 blocks!
10/21/2013
11
Excursions in Modern Mathematics, 7e: 1.1 - 61Copyright © 2010 Pearson Education, Inc.Copyright © 2014 Pearson Education. All rights reserved. 5.3-61
The graph in the figure represents a 4 block by 4
block street grid consisting of 40 blocks. The 12
odd vertices in the graph
Example 5.23 Covering a 4 by 4 Street Grid
are shown in red. We want
to eulerize the graph by
adding the least number of
edges.
Excursions in Modern Mathematics, 7e: 1.1 - 62Copyright © 2010 Pearson Education, Inc.Copyright © 2014 Pearson Education. All rights reserved. 5.3-62
This figure shows how not to do it! This graph violates the
cardinal rule of eulerization–you can only duplicate
edges that are part of
Example 5.23 Covering a 4 by 4 Street Grid
the original graph. Edges DF
and NL are new edges, not
duplicates, so this figure is
out!
Excursions in Modern Mathematics, 7e: 1.1 - 63Copyright © 2010 Pearson Education, Inc.Copyright © 2014 Pearson Education. All rights reserved. 5.3-63
This figure shows a legal eulerization, but it is not
optimal, as it is obvious that we could have
accomplished the same thing by adding fewer
duplicate edges.
Example 5.23 Covering a 4 by 4
Street Grid
Excursions in Modern Mathematics, 7e: 1.1 - 64Copyright © 2010 Pearson Education, Inc.Copyright © 2014 Pearson Education. All rights reserved. 5.3-64
This figure shows an optimal eulerization of the original
graph–one of several possible. Once we have an
optimal eulerization, we have the blueprint for an
optimal exhaustive closed
Example 5.23 Covering a 4 by 4 Street Grid
route on the original graph.
Regardless of the specific
details, we now know that the
route will travel along 48
blocks–the 40 original blocks in
the grid plus 8 deadhead
blocks.
Excursions in Modern Mathematics, 7e: 1.1 - 65Copyright © 2010 Pearson Education, Inc.Copyright © 2014 Pearson Education. All rights reserved. 5.3-65
In some situations we need to find an exhaustive
route, but there is no requirement that it be closed–
the route may start and end at different points. In
these cases we want to leave two odd vertices on
the graph unchanged and change the other odd
vertices into even vertices by duplicating appropriate
edges of the graph.
Open Route
Excursions in Modern Mathematics, 7e: 1.1 - 66Copyright © 2010 Pearson Education, Inc.Copyright © 2014 Pearson Education. All rights reserved. 5.3-66
This process is called a semi-eulerization of the graph.
When we strategically choose how to do this so that
the number of duplicate edges is as small as possible,
we can obtain an optimal exhaustive open route. In
this case the route will start at one of the two odd
vertices and end at the other one.
Semi-eulerization
10/21/2013
12
Excursions in Modern Mathematics, 7e: 1.1 - 67Copyright © 2010 Pearson Education, Inc.Copyright © 2014 Pearson Education. All rights reserved. 5.3-67
Let’s consider once again the 4 by 4 street grid.
Imagine that your job is to design a good route for a
Fourth of July parade that must pass through each of
the 40 blocks of the street grid. The key is that when
routing a parade, you do not
Example 5.24 Parade Route
want the parade to start and
end in the same place. In fact,
for traffic control it is usually
desirable to keep the starting
and ending points of a
parade as far from each other
as possible.
Excursions in Modern Mathematics, 7e: 1.1 - 68Copyright © 2010 Pearson Education, Inc.Copyright © 2014 Pearson Education. All rights reserved. 5.3-68
The fire department has added one additional
requirement to the parade route: The parade has to
start at B. Your task, then, is to find a semi-eulerization of
the graph that leaves B and
Example 5.24 Parade Route
one more odd vertex
unchanged(preferably a
vertex far from B) and that
changes all the other odd
vertices into even vertices.
Excursions in Modern Mathematics, 7e: 1.1 - 69Copyright © 2010 Pearson Education, Inc.Copyright © 2014 Pearson Education. All rights reserved. 5.3-69
This semi-eulerization is optimal because it required only
six duplicate edges, and this is as good as one can do.
The optimal parade route could be found by finding an
Euler path. The only bad
Example 5.24 Parade Route
thing about this route is that
the parade would end at P,
a point a bit too close to the
starting point, and the
traffic control people are
unhappy about that.
Excursions in Modern Mathematics, 7e: 1.1 - 70Copyright © 2010 Pearson Education, Inc.Copyright © 2014 Pearson Education. All rights reserved. 5.3-70
A different semi-eulerization is shown here. The parade
route in this case would not be optimal
Example 5.24 Parade Route
(it has seven deadhead
blocks), but because it ends
at K, it better satisfies the
requirement that the starting
and ending points be far
apart. The traffic control folks
are happy now.
Excursions in Modern Mathematics, 7e: 1.1 - 71Copyright © 2010 Pearson Education, Inc.Copyright © 2014 Pearson Education. All rights reserved. 5.3-71
This is the conclusion of the routing problem first introduced in Example 5.4. A photographer needs to take photos of each of the 11 bridges in Madison County.
Example 5.25 The Bridges of Madison County: Part 2
Excursions in Modern Mathematics, 7e: 1.1 - 72Copyright © 2010 Pearson Education, Inc.Copyright © 2014 Pearson Education. All rights reserved. 5.3-72
A graph model of the layout (vertices represent land masses, edges represent bridges) is shown.
Example 5.25 The Bridges of Madison County: Part 2
10/21/2013
13
Excursions in Modern Mathematics, 7e: 1.1 - 73Copyright © 2010 Pearson Education, Inc.Copyright © 2014 Pearson Education. All rights reserved. 5.3-73
The graph has four odd vertices (R, L, B, and D), sosome bridges are definitely going to have to be recrossed.
Example 5.25 The Bridges of Madison County: Part 2
Excursions in Modern Mathematics, 7e: 1.1 - 74Copyright © 2010 Pearson Education, Inc.Copyright © 2014 Pearson Education. All rights reserved. 5.3-74
How many and which ones depends on the other
parameters of the problem. (Recall that it costs $25 in
toll fees to cross a bridge, so the baseline cost for
crossing the 11 bridges is $275. Each recrossing is at an
additional cost of $25.) The following are a few of the
possible scenarios one might have to consider. Each
one requires a different eulerization and will result in a
different route.
Example 5.25 The Bridges of Madison County: Part 2
Excursions in Modern Mathematics, 7e: 1.1 - 75Copyright © 2010 Pearson Education, Inc.Copyright © 2014 Pearson Education. All rights reserved. 5.3-75
The photographer needs to start and end his trip in the
same place. This scenario requires an optimal
eulerization of the graph.
Example 5.25 The Bridges of Madison County: Part 2
This is not hard
to do, and an
optimal route
can be found
for a cost of
$325.
Excursions in Modern Mathematics, 7e: 1.1 - 76Copyright © 2010 Pearson Education, Inc.Copyright © 2014 Pearson Education. All rights reserved. 5.3-76
The photographer has the freedom to choose any
starting and ending points for his trip. In this case we
can find an optimal semi-
Example 5.25 The Bridges of Madison County: Part 2
eulerization of the
graph, requiring
only one
duplicate edge.
Now an optimal
route is possible at
a cost of $300.
Excursions in Modern Mathematics, 7e: 1.1 - 77Copyright © 2010 Pearson Education, Inc.Copyright © 2014 Pearson Education. All rights reserved. 5.3-77
The photographer has to start his trip at B and end the
trip at L. In this case we must find a semi-eulerization of
the graph where B and L remain as odd vertices and R
and D become even
Example 5.25 The Bridges of Madison County: Part 2
vertices. It is possible
to do this with just two
duplicate edges and
thus find an optimal
route that will cost
$325.
Excursions in Modern Mathematics, 7e: 1.1 - 78Copyright © 2010 Pearson Education, Inc.Copyright © 2014 Pearson Education. All rights reserved. 5.3-78
This example brings us full circle to the first couple of examples of this chapter. In Example 5.1 we raised the question of finding an optimal exhaustive closed route for a security guard hired to patrol the streets of the Sunnyside subdivision and we created the graph model for this problem.
Example 5.26 The Exhausted Patrol and the Grateful No Deadhead
10/21/2013
14
Excursions in Modern Mathematics, 7e: 1.1 - 79Copyright © 2010 Pearson Education, Inc.Copyright © 2014 Pearson Education. All rights reserved. 5.3-79
The graph has 18 odd vertices, shown in red. Wenow know that the name ofthe game is to find an optimal eulerization of this graph. In this case the oddvertices pair up beautifully, and the optimal eulerization requires only nine In this casethe odd vertices pair up beautifully, and the optimal eulerization requires only nine
Example 5.26 The Exhausted Patrol and the Grateful No Deadhead
Excursions in Modern Mathematics, 7e: 1.1 - 80Copyright © 2010 Pearson Education, Inc.Copyright © 2014 Pearson Education. All rights reserved. 5.3-80
All the answers to the security guards questions can now be answered: An optimal route will require nine deadhead blocks. The actual route can be found using trial and error or Fleury’s algorithm.
Example 5.26 The Exhausted Patrol and the Grateful No Deadhead
Excursions in Modern Mathematics, 7e: 1.1 - 81Copyright © 2010 Pearson Education, Inc.Copyright © 2014 Pearson Education. All rights reserved. 5.3-81
A slightly different problem is the one facingthe mail carrier delivering mail along thestreets of the Sunnyside subdivision. Much to the mail carrier’s pleasant surprise, in the graph thatmodels her situation all the vertices are even.
Example 5.26 The Exhausted Patrol and the Grateful No Deadhead
Excursions in Modern Mathematics, 7e: 1.1 - 82Copyright © 2010 Pearson Education, Inc.Copyright © 2014 Pearson Education. All rights reserved. 5.3-82
This means that the optimal route is an Euler circuit, which can be found once again using Fleury’s algorithm (or trialand error if you prefer). Thanks to the lessons of this chapter, this mail carrier will not have to deadhead, for which sheis extremely grateful!
Example 5.26 The Exhausted Patrol and the Grateful No Deadhead