Presentation on theme: "AMDM UNIT 7: Networks and Graphs"— Presentation transcript:
1AMDM UNIT 7: Networks and Graphs Euler Paths and Circuits
2Can You draw this figure without lifting you pencil from the paper?
3The original problemA 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.
4It was believed that it was impossible to do – but why It was believed that it was impossible to do – but why? Could Euler explain the reason?
5The 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.
7Euler Invents Graph Theory Euler realized that all problems of this form could be represented by replacing areas of land by points (what we call vertices), and the bridges to and from them by paths.
8Usually the graph is drawn like this (an isomorphic graph.)
9The problem now becomes one of drawing this picture without retracing any line and without picking your pencil up off the paper.
10Euler 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.
11Paths and CircuitsEuler 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
12Answer Questions 1 and 2 of Unit 7 SAS #1 Use numbered arrows to show the order of your paths. For example
133. For each graph, decide which have Euler circuits and which do not.
14Graphs I and III have Euler circuits Graphs I and III have Euler circuits. Graphs II and IV have Euler paths-a path but the starting and ending points are different.
15The degree of a vertex is the number edges that meet at the vertex The degree of a vertex is the number edges that meet at the vertex. Determine the degree of Graphs I-IV
16Graph I:: All vertices have degree of 2 Graph II: Staring in the upper left and moving clockwise the degrees are 2,3,2, and 3. The middle vertex has degree of 2. Graph III: Staring in the upper left and moving clockwise the degrees are 2,4,2, and 4. The middle vertex has degree of 2. Graph IV: Staring in the upper left and moving clockwise the degrees are 3,4,2, and 4. The middle vertex has degree of 3.
18Euler’s 1st TheoremIf 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).
20Finding Euler Circuits Algorithm: If a graph has all even degree vertices, then an Euler Circuit exists.Step One: Randomly move from vertex to vertex, until stuck. Since all vertices had even degree, the circuit must have stopped at its starting point. (It is a circuit.)Step Two: If any of the paths have not been included in our circuit, find a path that touches our partial circuit, and add in a new circuit.
21Each time we add a new circuit, we have included more vertices. Since there are only a finite number of vertices, eventually the whole graph is included.
22Use the algorithm to find an Euler circuit. Start here
24Euler’s 2nd TheoremIf 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.
28Euler for a connected directed graph If at each vertex the number in = number out, then there is an Euler circuitIf at one vertex number in = number out +1 and at one other vertex number in = number out -1, and all other vertices have number in = number out, then there is an Euler path.
29Path, circuit, or neither…? Path, circuit, or neither…?
30Hamilton CircuitGiven a graph, when is there a circuit passing through each vertex exactly one time?Hard to solve – only general algorithm known is to try each possible path, starting at each vertex in turn.For there are n! possible trials.
31The Traveling Salesman Problem A salesman needs to visit n cities and return home. What is the cheapest way to do this?Cinn170340Bos346Atl197279459Den
32TSP The traveling salesman problem is NP – complete. Practically, this means that there is no known polynomial-time algorithm to solve the problem – and there is unlikely to be one.