A problem Four people come to a river in the night. There is a narrow bridge, but it can only hold two people at a time. They have one torch and, because.

Slides:



Advertisements
Similar presentations
Discrete math Objectives: To learn vocabulary, vertex/edge patterns in discrete math. Vertex Edge Graph - A collection of points some of which are joined.
Advertisements

Chapter 2: Business Efficiency Lesson Plan
Copyright © 2005 Pearson Education, Inc. Slide 13-1.
Limitation of Computation Power – P, NP, and NP-complete
Introduction to Graph Theory Instructor: Dr. Chaudhary Department of Computer Science Millersville University Reading Assignment Chapter 1.
Lecture 21 Paths and Circuits CSCI – 1900 Mathematics for Computer Science Fall 2014 Bill Pine.
Chapter 4 sec. 2.  A famous and difficult problem to solve in graph theory.
Critical Paths.
Module 5 – Networks and Decision Mathematics Chapter 24 – Directed Graphs.
Design and Analysis of Algorithms - Chapter 31 Brute Force A straightforward approach usually based on problem statement and definitions Examples: 1. Computing.
Graphs. Overview What is a graph? Some terminology Types of graph Implementing graphs (briefly) Some graph algorithms Graphs 2/18.
A Presentation By: Jillian Minuto Troy Norman Alan Leggett Group Advisor: Prof. G. Warrington Graph Theory.
Chapter 3 Brute Force Copyright © 2007 Pearson Addison-Wesley. All rights reserved.
Homework collection Read Pages 175 – 184 Page 188: 21 – 26, 29 – 36, 41 – 44, 47 – 49, 51, 52, 59, 62, 63.
Design and Analysis of Algorithms - Chapter 31 Brute Force A straightforward approach usually based on problem statement and definitions Examples: 1. Computing.
Homework page 102 questions 1, 4, and 10 page 106 questions 4 and 5 page 111 question 1 page 119 question 9.
Homework collection Thursday 3/29 Read Pages 160 – 174 Page 185: 1, 3, 6, 7, 8, 9, 12 a-f, 15 – 20.
GRAPH Learning Outcomes Students should be able to:
Chapter 12 Coping with the Limitations of Algorithm Power Copyright © 2007 Pearson Addison-Wesley. All rights reserved.
UNIT 3 THINKING MATHEMATICALLY BY BLITZER Hamilton Paths and Hamilton Circuits.
Ch. 15: Graph Theory Some practical uses Degree of separation- Hollywood, acquaintance, collaboration Travel between cities Konigsberg bridge Shortest.
Graphs Their Applications. NC Standard Course of Study Competency Goal 1: The learner will use matrices and graphs to model relationships and solve problems.
Chapter 2: Business Efficiency Lesson Plan
CS 200 Algorithms and Data Structures
Graphs, Puzzles, & Map Coloring
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.
Page 714 #1-10 ANSWERS Lesson Reflection for Chapter 14 Section 7.
Chapter 3 Brute Force. A straightforward approach, usually based directly on the problem’s statement and definitions of the concepts involved Examples:
Aim: What is an Euler Path and Circuit?
The Travelling Salesperson Problem A salesperson needs to visit London, Nottingham, Manchester and Leeds, he lives in Birmingham. Find the shortest route.
Graph Theory Hamilton Paths Hamilton Circuits and.
Associated Matrices of Vertex Edge Graphs Euler Paths and Circuits Block Days April 30, May 1 and May
Euler Paths and Circuits. The original problem A resident of Konigsberg wrote to Leonard Euler saying that a popular pastime for couples was to try.
SECTION 5.1: Euler Circuit Problems
Lecture 52 Section 11.2 Wed, Apr 26, 2006
Walks, Paths and Circuits. A graph is a connected graph if it is possible to travel from one vertex to any other vertex by moving along successive edges.
1) Find and label the degree of each vertex in the graph.
Hamilton Paths and Circuits 1 Click to Start 2 3 Start End.
Chapter 3 Brute Force Copyright © 2007 Pearson Addison-Wesley. All rights reserved.
Chapter 14 Section 3 - Slide 1 Copyright © 2009 Pearson Education, Inc. AND.
Copyright © 2008 Pearson Education, Inc. Slide 13-1 Unit 13B The Traveling Salesman Problem.
(CSC 102) Lecture 30 Discrete Structures. Graphs.
1 GRAPH Learning Outcomes Students should be able to: Explain basic terminology of a graph Identify Euler and Hamiltonian cycle Represent graphs using.
Unit – graph theory. Concept Characteristics What is a Graph……Really?
MAT 110 Workshop Created by Michael Brown, Haden McDonald & Myra Bentley for use by the Center for Academic Support.
Brute Force A straightforward approach, usually based directly on the problem’s statement and definitions of the concepts involved Examples: Computing.
Shana Norman Dec 11, 2003 Final Project
Limitation of Computation Power – P, NP, and NP-complete
Brute Force A straightforward approach, usually based directly on the problem’s statement and definitions of the concepts involved Examples: Computing.
Brute Force A straightforward approach, usually based directly on the problem’s statement and definitions of the concepts involved Examples: Computing.
Task Tables Draw a graph for the following task table.
Chapter 3 Brute Force Copyright © 2007 Pearson Addison-Wesley. All rights reserved.
Konigsberg’s Seven Bridges
Chapter 3 Brute Force Copyright © 2007 Pearson Addison-Wesley. All rights reserved.
Discrete Maths 9. Graphs Objective
Can you draw this picture without lifting up your pen/pencil?
Chapter 4 Review Math Analysis
Hamiltonian Circuit/Paths:
* Hamiltonian Circuits introduction
Graph Theory.
Genome Assembly.
Chapter 2: Business Efficiency Business Efficiency
Chapter 3 Brute Force Copyright © 2007 Pearson Addison-Wesley. All rights reserved.
Brute Force A straightforward approach, usually based directly on the problem’s statement and definitions of the concepts involved Examples: Computing.
A path that uses every vertex of the graph exactly once.
Konigsberg- in days past.
Discrete math Objectives: To learn vocabulary, vertex/edge patterns in discrete math. Vertex Edge Graph - A collection of points some of which are joined.
Euler circuit Theorem 1 If a graph G has an Eulerian path, then it must have exactly two odd vertices. Theorem 2 If a graph G has an Eulerian circuit,
Warm Up – 3/14 - Friday 100 seats are to be apportioned.
Presentation transcript:

A problem Four people come to a river in the night. There is a narrow bridge, but it can only hold two people at a time. They have one torch and, because it's night, the torch has to be used when crossing the bridge, meaning that the torch must travel back across the bridge. When two people cross the bridge together, they must move at the slower person's pace. If person A can cross the bridge in 1 minute, B in 2 minutes, C in 3 minutes, and D in 4 minutes, how fast do all four of the cross the river?

What if the times are A(1), B(2), C(4), D (5) A problem Four people come to a river in the night. There is a narrow bridge, but it can only hold two people at a time. They have one torch and, because it's night, the torch has to be used when crossing the bridge, meaning that the torch must travel back across the bridge. When two people cross the bridge together, they must move at the slower person's pace. If person A can cross the bridge in 1 minute, B in 2 minutes, C in 3 minutes, and D in 4 minutes, how fast do all four of the cross the river? What if the times are A(1), B(2), C(4), D (5)

Hamiltonian Circuits Path through a circuit that touches every vertex once, not all edges must be used Must know by name Can be used to explain precedence Typically used to find most efficient route/order Edges are weighted (values assigned)

For Example BP Udall Mulvane Wellington 9 mi 16 mi 25 mi 9 mi 10 mi

Traveling Salesman Problem 20 A B 35 40 25 45 C D 30

ABCDA, ABDCA, ACBDA, ACDBA, ADBCA, ADCBA Similar: They touch each vertex once; Different: Some order just in different direction ABCDA (125), ABDCA (120), ACBDA (145), ACDBA (120), ADBCA (145), ADCBA (125) 120 mi or minutes Guess (4 city routes: 12144), 25 city routes: 6.24 x 1023 Answer

VE Graph Test tomorrow

Test Prep Be able to explain what a vertex and an edge is Example of VE Graph A group of classmates convene in a room. They quickly realize that they’ve all met before. Julie’s boyfriend Bill is Tyrese’s roommate. Tyrese works with Shawnna and is related to Levi’s roommate. Shawnna went to high school with Chris, Levi’s brother. Levi’s other brother, Xander dated Julie before Bill. Draw a Vertex Edge Graph modeling this situation How many people are in the room?

Test Prep

Test Prep List all the different paths, and compute the length of each path. Find the critical path and the EFT. Earliest Finish Time What are the critical tasks? Are there any tasks that can have their task times increased by 3 units and yet not cause a change in the EFT for the whole project? If so, which tasks? If not, why not?

Consider the school yearbook staff who has 16 days to complete the yearbook. They know what they have to do and how long it will take. (They can only use one camera, but everyone will cooperate). Do they make it? Task Time Prerequisite Start - A Buy film 1 None B Load Cameras C Take Photos of Clubs 3 D Take Sports Photos 2 E Take Teacher Photos F Develop Film D, E G Design Layout 5 H Print & Mail Pages G, F

Test Prep