Where in the World is Hermione Granger?.  Hermione has decided to get away from saving the world from He-Who-Must-Not-Be-Named by traveling the world.

Slides:



Advertisements
Similar presentations
1. Find the cost of each of the following using the Nearest Neighbor Algorithm. a)Start at Vertex M.
Advertisements

 Theorem 5.9: Let G be a simple graph with n vertices, where n>2. G has a Hamilton circuit if for any two vertices u and v of G that are not adjacent,
Section 3.4 The Traveling Salesperson Problem Tucker Applied Combinatorics By Aaron Desrochers and Ben Epstein.
6.8 The Cheapest-Link Algorithm. The Cheapest-Link Algorithm Pick the edge with the smallest weight and mark it Pick the next edge with the smallest weight.
Chapter 7 Graph Theory 7.1 Modeling with graphs and finding Euler circuits. Learning Objectives: Know how to use graphs as models and how to determine.
1 Appendix B: Solving TSP by Dynamic Programming Course: Algorithm Design and Analysis.
Chapter 15 Graph Theory © 2008 Pearson Addison-Wesley. All rights reserved.
1 Chapter 15.3 Hamilton Paths and Hamilton Circuits Objectives 1.Understand the definitions of Hamilton paths & Hamilton circuits. 2.Find the number of.
Computability and Complexity 23-1 Computability and Complexity Andrei Bulatov Search and Optimization.
7.3 Kruskal’s Algorithm. Kruskal’s Algorithm was developed by JOSEPH KRUSKAL.
Computability and Complexity 16-1 Computability and Complexity Andrei Bulatov NP-Completeness.
A traveling salesman has customers in 5 cities which we will call A, B, C, D, and E. The salesman needs to travel to all 5 cities with his trip starting.
Traveling-Salesman Problems
4/17/2017 Section 8.5 Euler & Hamilton Paths ch8.5.
The Travelling Salesman Algorithm A Salesman has to visit lots of different stores and return to the starting base On a graph this means visiting every.
Finding The Total Number Of Hamilton Circuits. The Traveling Salesman Problem is one of the most intensely studied problems in computational mathematics.
Copyright © Cengage Learning. All rights reserved.
Slide 14-1 Copyright © 2005 Pearson Education, Inc. SEVENTH EDITION and EXPANDED SEVENTH EDITION.
Excursions in Modern Mathematics, 7e: Copyright © 2010 Pearson Education, Inc. 6 The Mathematics of Touring 6.1Hamilton Paths and Hamilton Circuits.
Slide Copyright © 2009 Pearson Education, Inc. AND Active Learning Lecture Slides For use with Classroom Response Systems Chapter 14 Graph Theory.
Graph Theory Hamilton Paths and Hamilton Circuits.
May 1, 2002Applied Discrete Mathematics Week 13: Graphs and Trees 1News CSEMS Scholarships for CS and Math students (US citizens only) $3,125 per year.
1 Excursions in Modern Mathematics Sixth Edition Peter Tannenbaum.
6.1 Hamilton Circuits and Paths: Hamilton Circuits and Paths: Hamilton Path: Travels to each vertex once and only once… Hamilton Path: Travels to each.
© 2010 Pearson Prentice Hall. All rights reserved. 1 §15.3, Hamilton Paths and Circuits.
Spring 2015 Mathematics in Management Science Traveling Salesman Problem Approximate solutions for TSP NNA, RNN, SEA Greedy Heuristic Algorithms.
Copyright © 2014, 2010, 2007 Pearson Education, Inc. Section 4.2, Slide 1 4 Graph Theory (Networks) The Mathematics of Relationships 4.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 14.3 Hamilton Paths, and Hamilton Circuits.
Math 170 Project Part 3 By: Guadalupe Esquivel and Marlene Reyna.
6.4: The Brute-Force Algorithms
6.1 Hamilton Circuits and Hamilton Path
CIRCUITS, PATHS, AND SCHEDULES Euler and Königsberg.
Graph Theory Hamilton Paths Hamilton Circuits and.
AND.
Prims Algorithm for finding a minimum spanning tree
By: Christophe Dufour Chrishon Adams Mischael Joseph.
INTRO TO DISTANCE, DISPLACEMENT, SPEED, VELOCITY QUIZ REVIEW.
Excursions in Modern Mathematics, 7e: Copyright © 2010 Pearson Education, Inc. 6 The Mathematics of Touring 6.1Hamilton Paths and Hamilton Circuits.
Chapter 14 Section 3 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
Unit 2 Hamiltonian Circuits. Hamiltonian Circuit: A tour that starts at a vertex of a graph and visits each vertex once and only once, returning to where.
The Traveling Salesman Starring: Mr. Brute Force Co Starring: Mrs. Sorted Edge Lord Nearest Neighbor.
Turn in HW and Classwork sheet from last class. You have 10 minutes to complete the warm- up. After the warm-up, we will finish our notes on algorithms.
Spanning Trees Dijkstra (Unit 10) SOL: DM.2 Classwork worksheet Homework (day 70) Worksheet Quiz next block.
Mathematical modeling To describe or represent a real-world situation quantitatively, in mathematical language.
Graphs 1 Neil Ghani University of Strathclyde. Where are we …. We studied lists: * Searching and sorting a list Then we studied trees: * Efficient search.
MAT 110 Workshop Created by Michael Brown, Haden McDonald & Myra Bentley for use by the Center for Academic Support.
Hamilton Paths and Hamilton Circuits
Excursions in Modern Mathematics Sixth Edition
6.4: The Brute-Force Algorithms
Weighted Graphs and traveling Salesperson problem
Traveling Salesman Problems
HAMILTONIAN CIRCUIT ALGORITHMS
Lecture 10 CSE 331 Sep 21, 2016.
Lecture 10 CSE 331 Sep 20, 2017.
Section 14.3 Hamilton Paths, and Hamilton Circuits
Section 14.4 Trees.
Shortest Path.
6.1 Hamilton Circuits and Hamilton Path
Shortest Path Problems
Applied Combinatorics, 4th Ed. Alan Tucker
Part (a) m = m = -0.1 Acceleration is the derivative of velocity. We have a velocity graph, and the derivative is the slope. This question.
Discrete Mathematics Lecture 13_14: Graph Theory and Tree
Chapter 15 Graph Theory © 2008 Pearson Addison-Wesley.
Chapter 15 Graph Theory © 2008 Pearson Addison-Wesley.
Classwork Worksheet Homework (day 67) worksheet
Lecture 11 CSE 331 Sep 21, 2017.
Hamilton Paths and Hamilton Circuits
Traveling Salesman Problems Nearest Neighbor Method
Shortest Route Problems
Are the measures well justified?
Presentation transcript:

Where in the World is Hermione Granger?

 Hermione has decided to get away from saving the world from He-Who-Must-Not-Be-Named by traveling the world.  In order not to attract attention she decides not to use magic and chooses instead to partake in the muggle way of traveling. Her airline of choice is United Airlines.  She has chosen to go to Japan (J) to learn Ninjutsu, Australia (A) to observe Kangaroos, New Zealand (NZ) to watch the All Blacks Rugby Team, and South Africa (SA) for the World Cup.

Philadelphia- Australia (9,689) Philadelphia- New Zealand (8,739) Philadelphia- Japan (6,771 mi) Philadelphia- South Africa (8,764 mi) New Zealand-Japan (5,555 mi) New Zealand – Australia (1,338 mi) South Africa- New Zealand (7,192 mi) Japan- South Africa (9,134 mi) Japan- Australia (4,345 mi) Australia- South Africa (6,235 mi) P SA J A NZ

Philadelphia (P) Japan (J)New Zealand (NZ) Australia (A) South Africa (SA) Philadelphia (P) - 6,771 mi8,744 mi9,689 mi8,764 mi Japan (J)6,771 mi-5,472 mi4,345 mi9,134 mi New Zealand (NZ) 8,744 mi5,472 mi-1,338 mi7,253 mi Australia (A)9,689 mi4,345 mi1,338 mi-6,235 mi South Africa (SA) 8,764 mi9,134 mi7,253 mi6,235 mi-

 (n-1)! is the formula used to find the total number of Hamilton circuits in the graph.  Since we have 5 vertices the formula would give: (5-1)!  This simplifies to 4! Which means there are 4 x 3 x 2 x 1 = 24 circuits.

 Hermione chooses the shortest distance from each country/state beginning from home. Thus from Philadelphia she went to Japan.  From Japan, she chooses the shortest distance which took her to Australia; continuing to choose the shortest distance from each country/state, she then went to New Zealand, and on to South Africa before returning to Philadelphia.  This gave her a total distance of 28,471 miles.

Beginning and ending at P, the total distance is 28,471 miles. 6,771 4,345 1,338 7,253 8,764 P J A NZ SA

 She chooses the cheapest (shortest) edge avoiding mini – circuits and/or adding edges that result in a vertex with three edges (claw) to obtain the following:  New Zealand -- Australia: 1,338 miles  Japan -- Australia: 4,345 miles  South Africa -- Australia: XXX (Claw)  Japan – Philadelphia: 6,771 miles  South Africa – New Zealand: 7, 253 miles  South Africa – Philadelphia: 8,764 miles  Total = 28, 471 miles

P SA J A NZ 1,338 7,253 6,771 8,764 4,345

 In conclusion Hermione realizes that her best (optimal) route is given by either algorithm since they both produce the same route and total mileage: P – J – A – NZ – SA – P: 28, 471 miles  She did not use the Brute Force Algorithm because she could just use magic for that!  We wish her luck in her new film and her fight against He-Who-Must-Not-Be-Named.He-Who-Must-Not-Be-Named.

 Terry, E., Class Notes, July  Wikipedia, Internet, July 2010.