A Trip to England Nicholas Grice Angela Miranda A2 Computer Science 1.

Slides:



Advertisements
Similar presentations
Traffic assignment.
Advertisements

ITS THE FINAL LECTURE! (SING IT, YOU KNOW YOU WANT TO) Operations Research.
Solving Rational Equations and Inequalities
DIJKSTRA’s Algorithm. Definition fwd search Find the shortest paths from a given SOURCE node to ALL other nodes, by developing the paths in order of increasing.
Chapter 4 The Greedy Approach. Minimum Spanning Tree A tree is an acyclic, connected, undirected graph. A spanning tree for a given graph G=, where E.
Interpreting Graphs and Tables
1 Discrete Structures & Algorithms Graphs and Trees: II EECE 320.
Math Minutes - Monday 2.Which of the following does not lie on the line y = 3x – 2? A.(0, -2) B.(1, 1) C.(-1, 5) D.(2, 4) 1.
1 Greedy Algorithms. 2 2 A short list of categories Algorithm types we will consider include: Simple recursive algorithms Backtracking algorithms Divide.
Spring 2010CS 2251 Graphs Chapter 10. Spring 2010CS 2252 Chapter Objectives To become familiar with graph terminology and the different types of graphs.
Graphs & Graph Algorithms 2 Nelson Padua-Perez Bill Pugh Department of Computer Science University of Maryland, College Park.
Trip Planning Queries F. Li, D. Cheng, M. Hadjieleftheriou, G. Kollios, S.-H. Teng Boston University.
Chapter 2: Business Efficiency Lesson Plan Business Efficiency  Visiting Vertices-Graph Theory Problem Hamiltonian Circuits  Vacation Planning Problem.
“A trip around London. made by Maria Manasueva the pupil of the 10th form.
Welcome to London!. THERE ARE LOTS OF THINGS TO SEE IN LONDON LET´S VISIT LONDON.
London is the biggest city in Britain. 8,000,000 people live in London. London was the very first country in the world to have an underground railway.
The United Kingdom of Great Britain and Northern Ireland.
Powerpoint Templates Discover London. Powerpoint Templates.
Networks and the Shortest Path Problem.  Physical Networks  Road Networks  Railway Networks  Airline traffic Networks  Electrical networks, e.g.,
SPANNING TREES Lecture 21 CS2110 – Spring
IT 60101: Lecture #201 Foundation of Computing Systems Lecture 20 Classic Optimization Problems.
Graph Theory Hamilton Paths and Hamilton Circuits.
Dr. Naveed Ahmad Assistant Professor Department of Computer Science University of Peshawar.
London Marianne Piirmets 6.B. TOWER BRIDGE, LONDON, ENGLAND.
5-5 Solving Rational Equations and inequalities.  Solve rational equations and inequalities.
Where in the world would you go Marty Absher. Cities  Charlotte, NC  I never go here much.  Carowinds  Charlotte Coliseum.
Travelling. Answer the questions Do you like travelling? Where did you travel? I travelled to… Where are you going to travel? I am going to travel to.
WHO WANTS TO BE A MILLIONAIRE? QUIZ ABOUT LONDON.
uug.ru/video- dostoprimecha telnosti- londonahttp:// uug.ru/video- dostoprimecha telnosti- londona.
An-Najah N. University Faculty of Engineering and Information Technology Department of Management Information systems Operations Research and Applications.
Focus on Britain. Arrival at Waterloo Station London Eye Westminster Abbey Picadilly Circus A Traditional Pub in the Heart of London Covent Garden Back.
DESTINATION: LONDON-UK. LONDON IS THE CAPITAL OF THE UNITED KINGDOM OF GREAT BRITAIN. IT IS IN ENGLAND. POPULATION: 8 MILLIONS. THE RIVER THAMES. There.
Chapter 2: Business Efficiency Lesson Plan Business Efficiency  Visiting Vertices-Graph Theory Problem Hamiltonian Circuits  Vacation Planning Problem.
James has just returned from his trip to Europe. He looks into his wallet, and notices that he has the following notes:
Graphs A ‘Graph’ is a diagram that shows how things are connected together. It makes no attempt to draw actual paths or routes and scale is generally inconsequential.
The Travelling Salesperson Problem A salesperson needs to visit London, Nottingham, Manchester and Leeds, he lives in Birmingham. Find the shortest route.
Pg. 40 #13-24 ANSWERS.
«England. Traditions and History» Julia Yurievna Zaytseva School For handicapped children # 480 Kirovskiy district.
WELCOME TO LONDON! Let’s go sightseeing in London with Sasha Krylov, a Russian boy travelling around Great Britain.
SIGHTS OF LONDON WELL ? Great Britain the United Kingdom England London the Thames River the Tower of London the Tower Bridge the Houses of Parliament.
London. Basic Facts London is the capital city of the United Kingdom London has got about 7 milion people London consists of 3 parts: a)the City of London.
Though while when who which where who which where 2. Then, continue the sentence using a word next to the first one 1. Start from the left of the board.
I can describe the differences between Hamilton and Euler circuits and find efficient Hamilton circuits in graphs. Hamilton Circuits I can compare and.
The Problem A gallant and brave knight must traverse the lands to rescue the princess and claim his rightful place in the kingdom A Knight on a board.
We woke up at 7:00 o´clook and at 8:30 we have breakfast after that at 9:00 we started our London tour. We wolked along some London´s streets.First.
Network Problems A D O B T E C
Chapter 14 Section 3 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
Graphs 1 Neil Ghani University of Strathclyde. Where are we …. We studied lists: * Searching and sorting a list Then we studied trees: * Efficient search.
Exploring Computer Science
Network Models Chapter 12
Hamilton Paths and Hamilton Circuits
Greedy Algorithms.
Summer math curse By Adam Silverstein.
Solving Rational Equations and Inequalities
Shortest Path from G to C Using Dijkstra’s Algorithm
Exploring Computer Science
Network Models Chapter 12
Discrete Mathematics for Computer Science
Graph Algorithm.
учитель английского языка
Shortest Path.
The Knight’s Tour.
Chapter 2: Business Efficiency Business Efficiency
CSE 373: Data Structures and Algorithms
Advanced Analysis of Algorithms
Graph Searching.
Network Models Chapter 12
Chapter 15 Graph Theory © 2008 Pearson Addison-Wesley.
Chapter 15 Graph Theory © 2008 Pearson Addison-Wesley.
London is the Capital of the UK.
Presentation transcript:

A Trip to England Nicholas Grice Angela Miranda A2 Computer Science 1

Problem For winter break George’s family is going to England to visit his grandparents. As soon as he arrives his family went on a 3 day tour with his grandparents around England. But with so little gas in the tour bus, George must find the shortest route to all of the places he wants to visit: Tower of London Hyde Park River Thames Trafalgar square London Eye Marriot London, County hall. Find the shortest route for George by using these graphs:

Hyde Park Trafalgar Square Mariott London County Hall Tower of London London Eye River Thames 19 minutes 16 minutes 14 minutes 18 minutes 2 minutes 25 minutes 16 minutes 21 minutes 15 minutes 12 minutes 14 minutes 7 minutes 9 minutes 17 minutes TIME GRAPH

MILEAGE GRAPH Hyde Park Trafalgar Square Mariott London County Hall Tower of London London Eye River Thames 3.5miles 3.1 miles 1.5miles 2.3 miles.04 miles 5 miles 3.1 miles 3.9 miles 2.7 miles 2.2 miles 1.4 miles 2.8 miles 1.1 miles 2.3 miles 1.2 miles

Solution ( in miles and minutes) There are three solutions for Georges problem: Kruskal,Prims, and Dijkstra. Kruskals: ( miles) First start at The Marriott London, County hotel. Then connect to London Eye since its has the shortest amount of miles to take.(.04) Next go to Trafalgar Square since it has less mileage.(1.2) Afterwards go to River Thames because it has a lesser mileage consumption rate.(1.1) Then go to the Hyde Park for only 1.4 miles. Then finish the tour at The Tower of London(5) Total distance : 8.74miles Kruskals: (minutes) First start at The Marriot London, County hotel. Then go To London's Eye(2 minutes) Next go to Hyde Park( 14 minutes) Afterwards go to Trafalgar Square( 12 minutes) The go to River Thames( 9 minutes) Finally Tower Of London(21 minutes) Total distance: 58 min.

PRIMS Problem: George’s family noticed that they’re missing his wallet when they are at the end of the tour. They have to go back all the way up to the places they’ve visited to try to find the wallet. They picked River Thames as their starting point and they searched for it but it wasn’t there. Assume that the path is changed due to traffic. So they went to the nearest neighbor which is the Trafalgar Square. (1.1m) but still they couldn’t find it. After the Trafalgar Square, the nearest neighbor is the Hyde Park. (2.2m away from the Trafalgar Square) But still the wallet isn’t there. They went to London Eye (2.8m) the wallet isn’t there. Then the last option of nearest neighbor is the Tower of London. (2.7m) They connected all the destination but they couldn’t find the missing wallet. Total mileage: 8.8m Then suddenly they receive a call that someone had returned the wallet to the hotel so the case is solved.

MILEAGE GRAPH Hyde Park Trafalgar Square Mariott London County Hall Tower of London London Eye River Thames 3.5miles 2.3 miles.04 miles 5 miles 3.1 miles 2.7 miles 2.2 miles 2.8 miles 1.1 miles 2.3 miles

Solution ( miles and minutes) George wants to go to London's eye while still finding the shortest route from the Marriot Hotel to London's eye. Dijkstra(minutes): First start at the Marriot Hotel. Then compare the routes that is connected to the Marriott hotel,except London's eye. After comparing go to the Trafalgar square( 14 min) since it’s the least amount of time to get there. Then compare the time to go to River Thames