Scribd
Upload
288 views29 pages

Euler Paths and Circuits

1) Euler was asked to explain why it was impossible to cross each of the seven bridges in Konigsberg, Germany exactly once without crossing any bridge more than once. 2) Euler modeled the problem using a graphical representation, replacing land areas with points and bridges with lines connecting them. 3) Euler developed two theorems: a graph has an Euler circuit if every vertex has an even degree, and an Euler path if exactly two vertices have an odd degree.

Uploaded by

falconihla6191
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
288 views29 pages

Euler Paths and Circuits

1) Euler was asked to explain why it was impossible to cross each of the seven bridges in Konigsberg, Germany exactly once without crossing any bridge more than once. 2) Euler modeled the problem using a graphical representation, replacing land areas with points and bridges with lines connecting them. 3) Euler developed two theorems: a graph has an Euler circuit if every vertex has an even degree, and an Euler path if exactly two vertices have an odd degree.

Uploaded by

falconihla6191
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 29

Euler Paths and Circuits

The original problem


A resident of Konigsberg wrote to Leonard Euler saying that a popular pastime for couples was to try to cross each of the seven beautiful bridges in the city exactly once -- without crossing any bridge more than once.

It was believed that it was impossible to do but why? Could Euler explain the reason?

The Seven Bridges of Konigsberg


In Konigsberg, Germany, a river ran through the city such that in its center was an island, and after passing the island, the river broke into two parts. Seven bridges were built so that the people of the city could get from one part to another.

Konigsberg- in days past.

Euler Invents Graph Theory


Euler realized that all problems of this form could be represented by replacing areas of land by points (what we call nodes), and the bridges to and from them by arcs.

Usually the graph is drawn like this (an isomorphic graph.)

The problem now becomes one of drawing this picture without retracing any line and without picking your pencil up off the paper.

Euler saw that there were 5 vertices that each had an odd number of lines connected to it. He stated they would either be the beginning or end of his pencil-path.

Paths and Circuits


Euler path- a continuous path that passes through every edge once and only once.
Euler circuit- when a Euler path begins and ends at the same vertex

Eulers 1st Theorem


If a graph has any vertices of odd degree, then it can't have any Euler circuit. If a graph is connected and every vertex has an even degree, then it has at least one Euler circuit (usually more).

Proof: Spose we have an Euler circuit.

If a node has an odd degree, and the circuit starts at this node, then it must end elsewhere. This is because after we leave the node the first time the node has even degree, and every time we return to the node we must leave it. (On the paired arc.)

If a node is odd, and the circuit begins else where, then it must end at the node. This is a contradiction, since a circuit must end where it began.

Euler Circuit?

If a graph has all even degree nodes, then


an Euler Circuit exists.

Algorithm: Step One: Randomly move from node to node, until stuck. Since all nodes had even degree, the circuit must have stopped at its starting point. (It is a circuit.) Step Two: If any of the arcs have not been included in our circuit, find an arc that touches our partial circuit, and add in a new circuit.

Each time we add a new circuit, we have included more nodes. Since there are only a finite number of nodes, eventually the whole graph is included.

Use the algorithm to find an Euler circuit.

Use algorithm all even?


0 1 0 A 0 1 2 1 0 0 1 2 0 1 0 1 1 1 0 1 1 1 0 1 0 0 1 1 1 0 0 0 1 1 1 0 1

Eulers 2nd Theorem


If a graph has more than two vertices of odd degree, then it cannot have an Euler path.
If a graph is connected and has exactly two vertices of odd degree, then is has at least one Euler path. Any such path must start at one of the odd degree vertices and must end at the other odd degree vertex.

Find the Euler Path

A detail
We said that if the number of odd degree vertices =0, then Euler circuit =2, then path What if =1????

A directed graph Is there an Euler Circuit?

Euler for a connected directed graph

If at each node the number in = number out, then there is an Euler circuit If at one node number in = number out +1 and at one other node number in = number out -1, and all other nodes have number in = number out, then there is an Euler path.

Path, circuit, or neither?

Hamilton Circuit

Given a graph, when is there a circuit passing through each node exactly one time?
Hard to solve only general algorithm known is to try each possible path, starting at each vertex in turn. For K n there are n! possible trials.

The Traveling Salesman Problem

A salesman needs to visit n cities and return home. What is the cheapest way to do this? Cinn
170 Bos 279 346 197 340 Atl

459
Den

TSP
The traveling salesman problem is NP complete. Practically, this means that there is no know polynomial-time algorithm to solve the problem and there is unlikely to be one.

You might also like