euler circuits - national paralegal college circuits parking-control ... beyond euler circuits...

Chapter 1: Urban Services

Lesson Plan

Euler Circuits Parking-Control Officer Problem

Finding Euler Circuits Qualifications: Even Valence and Connectedness

Beyond Euler Circuits Chinese Postman Problem

Eulerizing a Graph

Urban Graph Traversal Problems More practical applications and modifications

© 2013 W. H. Freeman and Company

Mathematical Literacy in Today’s World, 9th ed.

For All Practical Purposes


Management Science

Management Science Uses mathematical methods to help find optimal solutions to

management problems. Often called Operations Research.

Optimal Solutions: The best (most favorable) solution Government, business, and individuals all seek optimal results.

Optimization problems:

Finish a job quickly

Maximize profits

Minimize costs

Urban Services to optimize:

Checking parking meters

Delivering mail

Removing snow

Parking-Control Officer Problem Checking parking meters

Our job is to find the most efficient route for the parking-control officer to walk as he checks the parking meters.

Problem: Check the meters on the top two blocks.

Goals for Parking-Control Officer Must cover all the sidewalks without

retracing any more steps than necessary.

Should end at the same point at which he began.

Problem: Start and end at the top left-hand corner of the left-hand block.


Euler Circuits

Euler circuit – A circuit

that traverses each edge

of a graph exactly once

and starts and stops at

the same point.

Street map for part of a town.


Euler Circuits

Simplified graph (a) is superimposed on

the streets with parking meters.

Simplified graph (b) is enlarged to show

the points (vertices) labeled with letters

A – F, which are linked by edges.

Graph – A finite set of dots (vertices) and connecting links (edges).

Graphs can represent our city map, air routes, etc.

Vertex (pl. vertices) – A point (dot) in a graph where the edges meet.

Edge – A link that joins two vertices in a graph (traverse edges).

Path – A connected sequence of edges showing a route, described

by naming the vertices traveled.

Circuit – A path that starts and ends at the same vertex.


Euler Circuits

Circuit vs. Euler Circuit (Both start and end at same vertex.)

Path vs. Circuit Paths – Paths can start and end at

any vertex using the edges given.

Examples: NLB, NMRB, etc.

Circuits – Paths that starts and

ends at the same vertex. Examples:

MRLM, LRBL, etc. Nonstop air routes

Circuits may retrace edges

or not use all the edges.

Euler circuits travel each edge

once and cover all edges.

Two Ways to Find an Euler Circuit

Trial and error

Keep trying to create different paths to find one that starts and

ends at the same point and does not retrace steps.

Mathematical approach (better method)

An Euler circuit exists if the following statements are true:

All points (vertices) have even valence.

The graph is connected.


Finding Euler Circuits

Leonhard Euler (1707–1783)

Among other discoveries, he was credited

with inventing the idea of a graph as well as

the concepts of valence and connectedness.



Valence – The number of edges touching that vertex

(counting spokes on the hub of a wheel).

Connectedness – You can reach any vertex by

traversing the edges given in the graph.

Euler circuit – Has even-valent vertices and is connected. If vertices have odd valence,

it is not an Euler circuit.

An Euler circuit starting and ending at A

Euler Circuit Theorem

1. If a graph G is connected and has all even valences, then G has an Euler circuit.

2. Conversely, if G has an Euler circuit, then G must be connected and all of its valences must be even numbers.



Is there an Euler

Circuit?

Does it have even

valence? (Yes)

Is the graph

connected? (Yes)

Euler circuit exists if both “yes.”

Create (Find) an Euler Circuit

Pick a point to start (if none has been

given to you).

Number the edges in order of travel,

showing the direction with arrows.

Cover every edge only once, and end at

the same vertex where you started.


Beyond Euler Circuits

Chinese Postman Problem In real life, not all problems will be perfect Euler circuits.

If no Euler circuit exists (odd valences), you want to minimize the length of the circuit by carefully choosing the edges to be retraced.

For our purposes, we assume all edges have the same length—simplified Chinese postman problem.

Chinese mathematician Meigu Guan first studied this problem in 1962, hence the name.

The blue dots indicate parking meters

along the street.

The graph represents edges with parking meters.

Notice only vertices C and G have odd valence.



Eulerize the Graph to Solve Chinese Postman Problem

For graphs that are connected but have vertices with odd

valence, we will want to reuse (duplicate) the minimum number of

edges until all vertices appear to have even valence.

Only existing edges can be duplicated (or added).

Each edge that is duplicated (added) will later be the edge that

will be reused during eulerization.

The edge CG is reused,

which would make all vertices

appear to have even valence.

A circuit is made by reusing the edge CG. Below, the

graph is eulerized (starts and stops at same point and

covers all “edges” once — including reused ones).



Eulerizing a Graph 1. On the graph, add edges by duplicating

existing ones, until you arrive at a graph that is connected and even-valent.

The graph to the right is an efficient eulerization because the fewest number of edges were added.

2. Find an Euler circuit on the eulerized graph.

Traverse every original and “added” edge once, as you find a circuit that starts and ends at the same vertex.

3. “Squeeze” this Euler circuit from the eulerized graph onto the original graph by replacing the “added” edge with an arrow showing it was retraced.

Squeeze the eulerized circuit

onto the graph.

Only reuse (add) edge BC.



Hints for Eulerizing a Graph For the most efficient eulerization, look for the fewest edges to

add to make all vertices even.

Typically, locate odd valence vertices and try to reuse (add) the connecting edge between the vertices.

Sometimes vertices are more than one edge apart; in this case, reuse edges between vertices (see graph below).

Remember: Only duplicate (add to) the existing edges.

Odd vertices, X and Y, are

more than one edge apart.

This is not allowed — must

only reuse existing edges.

Reuse existing edges

between the odd vertices.



Rectangular Networks – This is the name given to a street

network composed of a series of rectangular blocks that form a large

rectangle made up of so many blocks high by so many blocks wide.

Eulerizing rectangular networks:

“Edge Walker”

Start in upper-left corner (at A).

Travel (clockwise) around the

outer boundary.

As you travel, add an edge by

the following rules:

1. If the vertex is odd, add an edge by linking it to the next vertex.

If this next vertex becomes even, skip it (just keep “walking”).

If this next vertex becomes odd, (on a corner) link it to the next vertex.

2. Repeat this rule until you reach the upper-left corner again.


Urban Graph Traversal Problem

Euler Circuits and Eulerizing Graphs: Practical Applications

Checking parking meters (discussed)

Collecting garbage

Salting icy roads

Inspecting railroad tracks

Special Requirements May Need to Be Addressed

Traffic directions

Number of streets/lanes (divided routes)

Parking time restriction

Theory Modifications Can Address Special Requirements

A digraph (directed graph) is used to show a one-way street.

Arrows show restriction in traversal possibilities (not part of circuits).

Territories may need to be divided into multiple routes.

euler circuits - national paralegal college circuits parking-control ... beyond euler circuits...

Documents