5 The Mathematics of Getting Around

Slides:



Advertisements
Similar presentations
Introduction to Graph Theory Instructor: Dr. Chaudhary Department of Computer Science Millersville University Reading Assignment Chapter 1.
Advertisements

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.
Lecture 21 Paths and Circuits CSCI – 1900 Mathematics for Computer Science Fall 2014 Bill Pine.
Section 14.1 Intro to Graph Theory. Beginnings of Graph Theory Euler’s Konigsberg Bridge Problem (18 th c.)  Can one walk through town and cross all.
Algorithms & Complexity
Management Science 461 Lecture 2b – Shortest Paths September 16, 2008.
Koenigsberg bridge problem It is the Pregel River divided Koenigsberg into four distinct sections. Seven bridges connected the four portions of Koenigsberg.
Excursions in Modern Mathematics, 7e: Copyright © 2010 Pearson Education, Inc. 5 The Mathematics of Getting Around 5.1Euler Circuit Problems 5.2What.
Chapter 11 Section 1 Introduction to Difference Equations.
Introduction to Networks HON207. Graph Theory In mathematics and computer science, graph theory is the study of graphs, mathematical structures used to.
Homework collection Thursday 3/29 Read Pages 160 – 174 Page 185: 1, 3, 6, 7, 8, 9, 12 a-f, 15 – 20.
Modelling and scientific programming. Objectives To learn to develop computer programs that are  Correct  Efficient  Adaptable  Portable.
Euler Circuit Chapter 5. Fleury’s Algorithm Euler’s theorems are very useful to find if a graph has an Euler circuit or an Euler path when the graph is.
Irene Díaz 1, Camino R. Vela 1 1 Computer Science Department. University of Oviedo (SPAIN) s 1.
Math for Liberal Studies.  Here is a map of the parking meters in a small neighborhood  Our goal is to start at an intersection, check the meters, and.
Discrete Math Round, Round, Get Around… I Get Around Mathematics of Getting Around.
Factor Graphs Young Ki Baik Computer Vision Lab. Seoul National University.
Chapter 15 Graph Theory © 2008 Pearson Addison-Wesley.
Programming for Geographical Information Analysis: Advanced Skills Online mini-lecture: Introduction to Networks Dr Andy Evans.
Excursions in Modern Mathematics, 7e: Copyright © 2010 Pearson Education, Inc. 5 The Mathematics of Getting Around 5.1Euler Circuit Problems 5.2What.
1 Excursions in Modern Mathematics Sixth Edition Peter Tannenbaum.
1 Starter of the day 23 x 27 = x 47 = x 87 = x 55 = x 58 = ???? 54 x 56 = ???? Can you spot the trick for this group of.
Graph Theory in Computer Science
“Graph theory” for the master degree program “Geographic Information Systems” Yulia Burkatovskaya Department of Computer Engineering Associate professor.
Spring 2015 Mathematics in Management Science Chinese Postman Problem What is CPP? CPP & ECs & EPs Fleury’s Algorithm Eulerization.
1 Excursions in Modern Mathematics Sixth Edition Peter Tannenbaum.
Lesson Reflection for Chapter 14 Section 6 Pre-Algebra Learning Goal Students will understand collecting, displaying, & analyzing data.
Excursions in Modern Mathematics, 7e: Copyright © 2010 Pearson Education, Inc. 5 The Mathematics of Getting Around 5.1Euler Circuit Problems 5.2What.
5 The Mathematics of Getting Around
5.4 Graph Models (part I – simple graphs). Graph is the tool for describing real-life situation. The process of using mathematical concept to solve real-life.
ELEN 033 Lecture #1 Tokunbo Ogunfunmi Santa Clara University.
Examples Euler Circuit Problems Unicursal Drawings Graph Theory
Copyright © 2014, 2010, 2007 Pearson Education, Inc. Section 4.1, Slide 1 4 Graph Theory (Networks) The Mathematics of Relationships 4.
Aim: What is an Euler Path and Circuit?
Excursions in Modern Mathematics, 7e: Copyright © 2010 Pearson Education, Inc. 5 The Mathematics of Getting Around 5.1Euler Circuit Problems 5.2What.
Lecture 10: Graph-Path-Circuit
AND.
10-1 An Introduction to Systems A _______ is a set of sentences joined by the word ____ or by a ________________. Together these sentences describe a ______.
© 2010 Pearson Prentice Hall. All rights reserved. CHAPTER 15 Graph Theory.
Lecture 11: 9.4 Connectivity Paths in Undirected & Directed Graphs Graph Isomorphisms Counting Paths between Vertices 9.5 Euler and Hamilton Paths Euler.
Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 14.2 Euler Paths, and Euler Circuits.
Chapter 6: Graphs 6.1 Euler Circuits
Chapter 5: The Mathematics of Getting Around
Excursions in Modern Mathematics, 7e: Copyright © 2010 Pearson Education, Inc. 5 The Mathematics of Getting Around 5.1Euler Circuit Problems 5.2What.
David Stotts Computer Science Department UNC Chapel Hill.
Graph Theory Euler Paths and Euler Circuits. Euler Paths & Circuits Euler Paths and Euler Circuits (Euler is pronounced the same as Oiler) An Euler path.
Analogous Behavior Concepts: Circuit theory, Translational Mechanics Equations: voltage (V) = current (i) x resistance (R) Force (f) = Velocity (v) x Damper.
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.
Dr. Wang Xingbo QQ: Homepage: wxbstudio.home4u.china.com Fall , 2005 Mathematical & Mechanical Method in Mechanical.
Fleury's Algorithm Euler Circuit Algorithm
Excursions in Modern Mathematics Sixth Edition
Excursions in Modern Mathematics Sixth Edition
Excursions in Modern Mathematics Sixth Edition
Data Structures Graphs - Terminology
UNIT 1: EULER CIRCUITS GRAPH THEORY.
This unit is all about Puzzles Games Strategy.
Graphs Chapter 13.
5 The Mathematics of Getting Around
Excursions in Modern Mathematics Sixth Edition
5 The Mathematics of Getting Around
5 The Mathematics of Getting Around
Euler Paths and Euler Circuits
Chapter 7 The Technical Laboratory
A Survey of Mathematics with Applications
Intersection Method of Solution
5 The Mathematics of Getting Around
5 The Mathematics of Getting Around
5 The Mathematics of Getting Around
Presentation transcript:

5 The Mathematics of Getting Around CONCLUSION

Themes of Chapter 5 In this chapter we got our first introduction to three fundamental ideas. First, we learned about a simple but powerful concept for describing relationships within a set of objects – the concept of a graph. This idea can be traced back to Euler, some 270 years ago. Since then, the study of graphs has grown into one of the most important and useful branches of modern mathematics.

Themes of Chapter 5 The second important idea of this chapter is the concept of a graph model. Every time we take a real-life problem and turn it into a mathematical problem, we are, in effect, modeling. In this chapter we learned about a new type of modeling called graph modeling, in which we use graphs and the mathematical theory of graphs to solve certain types of routing problems.

Themes of Chapter 5 By necessity, the routing problems that we solved in this chapter were fairly simplistic – crossing a few bridges, patrolling a small neighborhood, designing a parade route – what’s all the fuss about? We should not be deceived by the simplicity of these examples – larger-scale variations on these themes have significant practical importance.

Themes of Chapter 5 In many big cities, where the efficient routing of municipal services (police patrols, garbage collection, etc.) is a major issue, the very theory that we developed in this chapter is being used on a large scale, the only difference being that many of the more tedious details are mechanized and carried out by a computer.

Themes of Chapter 5 The third important concept introduced in this chapter is that of an algorithm – a set of procedural rules that, when followed, provide solutions to certain types of problems. In this chapter we learned about Fleury’s algorithm, which helps us find an Euler circuit or an Euler path in a graph.

Themes of Chapter 5 When it comes to algorithms of any kind, be they for doing arithmetic calculations or for finding circuits in graphs, there is one standard piece of advice that always applies: Practice makes perfect.