Chapter 14 Section 3 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND

Copyright © 2009 Pearson Education, Inc. Chapter 14 Section 3 - Slide 2 Chapter 14 Graph Theory

Chapter 14 Section 3 - Slide 3 Copyright © 2009 Pearson Education, Inc. WHAT YOU WILL LEARN Graphs, paths and circuits The Königsberg bridge problem Euler paths and Euler circuits Hamilton paths and Hamilton circuits Traveling salesman problem Brute force method

Copyright © 2009 Pearson Education, Inc. Chapter 14 Section 3 - Slide 4 Section 3 Hamilton Paths and Hamilton Circuits

Chapter 14 Section 3 - Slide 5 Copyright © 2009 Pearson Education, Inc. Definitions A Hamilton path is a path that contains each vertex of a graph exactly once. A Hamilton circuit is a path that begins and ends at the same vertex and passes through all other vertices of the graph exactly one time.

Chapter 14 Section 3 - Slide 6 Copyright © 2009 Pearson Education, Inc. Example: Hamilton Path Graph (a) shown has Hamilton path A, B, C, E, D. The graph also has Hamilton path C, B, A, D, E. Can you find some others? Graph (b) shown has Hamilton path A, B, C, F, H, E, G, D. The graph also has Hamilton path G, D, E, H, F, C, B, A. Can you find some others?

Chapter 14 Section 3 - Slide 7 Copyright © 2009 Pearson Education, Inc. Example: Hamilton Circuit Graph (a) shown has Hamilton circuit A, B, D, G, E, H, F, C, A. A Hamilton circuit starts and ends at the same vertex. Graph (b) shown has Hamilton circuit A, B, C, E, D, A. Can you find another?

Chapter 14 Section 3 - Slide 8 Copyright © 2009 Pearson Education, Inc. Definition A complete graph is a graph that has an edge between each pair of its vertices.

Chapter 14 Section 3 - Slide 9 Copyright © 2009 Pearson Education, Inc. Example: Finding Hamilton Circuits Determine a Hamilton circuit for the graph shown. One solution is A, G, F, E, C, D, B, A A B C E F G D

Chapter 14 Section 3 - Slide 10 Copyright © 2009 Pearson Education, Inc. Number of Unique Hamilton Circuits in a Complete Graph The number of unique Hamilton circuits in a complete graph with n vertices is (n  1)!, where (n  1)! = (n  1)(n  2)(n  3)…(3)(2)(1)

Chapter 14 Section 3 - Slide 11 Copyright © 2009 Pearson Education, Inc. Example: Number of Hamilton Circuits How many unique Hamilton circuits are there in a complete graph with the following number of vertices? a) 4b) 9 a) 4 = (4  1)! = 321 = 6 b) 9 = (9  1)! = = 40,320

Chapter 14 Section 3 - Slide 12 Copyright © 2009 Pearson Education, Inc. The Brute Force Method of Solving Traveling Salesman Problems To determine the optimal solution: 1.Represent the problem with a complete, weighted graph. 2.List all possible Hamilton circuits for this graph. 3.Determine the cost (or distance) associated with each of these Hamilton circuits. 4.The Hamilton circuit with the lowest cost (or shortest distance) is the optimal solution.

Chapter 14 Section 3 - Slide 13 Copyright © 2009 Pearson Education, Inc. Example: Brute Force Method Find a minimum Hamilton circuit for the complete, weighted graph shown. List all the Hamilton circuits. Since there are 4 vertices there are (4  1)! = 3! = 6 possible circuits. AB CD

Chapter 14 Section 3 - Slide 14 Copyright © 2009 Pearson Education, Inc. Example: Brute Force Method continued A, D, C, B, A A, D, B, C, A A, C, D, B, A Fourth Leg A, C, B, D, A A, B, D, C, A A, B, C, D, A Total Third Leg Second Leg First Leg Circuit The minimum amount for the graph would be 22. AB CD

Chapter 14 Section 3 - Slide 15 Copyright © 2009 Pearson Education, Inc. Nearest Neighbor Method of Determining an Approximate Solution to a Traveling Salesman Problem To approximate a optimal solution: 1. Represent the problem with a complete, weighted graph. 2.Identify the starting vertex. 3.Of all the edges attached to the starting vertex, choose the edge that has the smallest weight. This edge is generally either the shortest distance or the lowest cost. Travel along this edge to the second vertex.

Chapter 14 Section 3 - Slide 16 Copyright © 2009 Pearson Education, Inc. Nearest Neighbor Method of Determining an Approximate Solution to a Traveling Salesman Problem (continued) 4.At the second vertex, choose the edge that has the smallest weight that does not lead to a vertex already visited. Travel along this edge to the third vertex. 5.Continue this process, each time moving along the edge with the smallest weight until all vertices are visited. 6.Travel back to the original vertex.

Chapter 14 Section 3 - Slide 17 Copyright © 2009 Pearson Education, Inc. Example: Nearest Neighbor An appliance repair man must repair four appliances at the locations shown in the graph on the next slide. The estimated travel time (in minutes) is shown between the four locations. The repair man wants to visit the four locations in an order that takes the least amount of time. Use the nearest neighbor algorithm to find an approximate solution to the problem.

Chapter 14 Section 3 - Slide 18 Copyright © 2009 Pearson Education, Inc. Example: Nearest Neighbor (continued) Choose a starting vertex. Let’s choose vertex A. Choose the edge that has the smallest weight. Either AD or AB, lets choose AD (8). At D choose the edge that has the smallest weight DE (4). E start here 2 nd vertex C B A D

Chapter 14 Section 3 - Slide 19 Copyright © 2009 Pearson Education, Inc. Example: Nearest Neighbor (continued) Continue moving along the edge with the smallest weight. Circuit would be: A, D, E, B, C, A = 37 This route would take about 37 minutes. start here 2 nd vertex C B A E D

Chapter 14 Section 3 - Slide 20 Copyright © 2009 Pearson Education, Inc. Example: Nearest Neighbor (continued) Other circuits and weights = 47E, B, D, C, A, EE = 34 D, E, B, A, C, D D = 34 C, D, E, B, A, C C = 34B, E, D, C, A, BB Total WeightCircuitStarting Vertex