Street-Routing Problems

Size: px
Start display at page:

Download "Street-Routing Problems"

Transcription

1 Street-Routing Problems Lecture 26 Sections Robb T. Koether Hampden-Sydney College Wed, Oct 25, 2017 Robb T. Koether (Hampden-Sydney College) Street-Routing Problems Wed, Oct 25, / 21

2 1 Street-Routing Problems 2 Definitions 3 Examples 4 Assignment Robb T. Koether (Hampden-Sydney College) Street-Routing Problems Wed, Oct 25, / 21

3 Outline 1 Street-Routing Problems 2 Definitions 3 Examples 4 Assignment Robb T. Koether (Hampden-Sydney College) Street-Routing Problems Wed, Oct 25, / 21

4 Street-Routing Problems There are many problems that fall under the heading Street-Routing Problems. We will consider five of them. Robb T. Koether (Hampden-Sydney College) Street-Routing Problems Wed, Oct 25, / 21

5 Street-Routing Problems There are many problems that fall under the heading Street-Routing Problems. We will consider five of them. The Security Guard Problem Robb T. Koether (Hampden-Sydney College) Street-Routing Problems Wed, Oct 25, / 21

6 Street-Routing Problems There are many problems that fall under the heading Street-Routing Problems. We will consider five of them. The Security Guard Problem The Mail Carrier Problem Robb T. Koether (Hampden-Sydney College) Street-Routing Problems Wed, Oct 25, / 21

7 Street-Routing Problems There are many problems that fall under the heading Street-Routing Problems. We will consider five of them. The Security Guard Problem The Mail Carrier Problem The Königsberg Bridge Problem (famous) Robb T. Koether (Hampden-Sydney College) Street-Routing Problems Wed, Oct 25, / 21

8 Street-Routing Problems There are many problems that fall under the heading Street-Routing Problems. We will consider five of them. The Security Guard Problem The Mail Carrier Problem The Königsberg Bridge Problem (famous) The Bridges of Madison County Robb T. Koether (Hampden-Sydney College) Street-Routing Problems Wed, Oct 25, / 21

9 Street-Routing Problems There are many problems that fall under the heading Street-Routing Problems. We will consider five of them. The Security Guard Problem The Mail Carrier Problem The Königsberg Bridge Problem (famous) The Bridges of Madison County The Traveling Salesman Problem (famous) Robb T. Koether (Hampden-Sydney College) Street-Routing Problems Wed, Oct 25, / 21

10 The Security Guard Problem Example (The Security Guard Problem) A security guard must patrol every street of the neighborhood. What route should he follow to minimize the total distance? Must he walk some streets twice? Robb T. Koether (Hampden-Sydney College) Street-Routing Problems Wed, Oct 25, / 21

11 The Mail Carrier Problem Example (The Mail Carrier Problem) A mail carrier must deliver mail to both sides of every street of the neighborhood, except the boundary. What route should he follow to minimize the total distance? Must he walk some streets (same side) twice? Robb T. Koether (Hampden-Sydney College) Street-Routing Problems Wed, Oct 25, / 21

12 The Königsberg Problem Example (The Königsberg Problem) A Königsberger would like to take a stroll across the seven bridges of Königsberg. Can it be done without ever crossing the same bridge twice? Does it matter where the stroller starts? Robb T. Koether (Hampden-Sydney College) Street-Routing Problems Wed, Oct 25, / 21

13 The Bridges of Madison County Problem Example (The Bridges of Madison County Problem) A photographer wants to photograph each of the 11 bridges of Madison County. He must cross the bridge to photograph it and each bridge has a $5 toll. What route will minimize the total cost? Robb T. Koether (Hampden-Sydney College) Street-Routing Problems Wed, Oct 25, / 21

14 The Bridges of Madison County Problem Example (The Bridges of Madison County Problem) A photographer wants to photograph each of the 11 bridges of Madison County. He must cross the bridge to photograph it and each bridge has a $5 toll. What route will minimize the total cost? Robb T. Koether (Hampden-Sydney College) Street-Routing Problems Wed, Oct 25, / 21

15 The Traveling Salesman Problem Example (The Traveling Salesman Problem) 8 B I 9 A J 9 7 C F 10 6 E 7 D H 9 G A salesman is located in a city. He must make a trip during which he visits each of a number of other cities and return to his home city. He knows the distance from every city to every other city. What route will minimize the total distance traveled? Robb T. Koether (Hampden-Sydney College) Street-Routing Problems Wed, Oct 25, / 21

16 Outline 1 Street-Routing Problems 2 Definitions 3 Examples 4 Assignment Robb T. Koether (Hampden-Sydney College) Street-Routing Problems Wed, Oct 25, / 21

17 Definitions Definition A graph is a collection of vertices and edges. We normally draw the vertices as dots and the edges as lines. Each edge connects a pair of vertices. Robb T. Koether (Hampden-Sydney College) Street-Routing Problems Wed, Oct 25, / 21

18 Definitions We can give the vertices labels, e.g., A, B, C, etc. Then use those labels to identify the edges, e.g., AB, AC, etc. A B D E C Robb T. Koether (Hampden-Sydney College) Street-Routing Problems Wed, Oct 25, / 21

19 Definitions Definition (Path) A path is a sequence of edges, each edge adjacent to the next edge. We may denote a path by listing the vertices through which it passes. (E.g., DABC.) A B D E C Robb T. Koether (Hampden-Sydney College) Street-Routing Problems Wed, Oct 25, / 21

20 Definitions Definition (Circuit) A circuit is a path that begins and ends at the same vertex. (E.g., ABCA.) A B D E C Robb T. Koether (Hampden-Sydney College) Street-Routing Problems Wed, Oct 25, / 21

21 Definitions Definition (Weighted Graph) A weighted graph is a graph in which every edge is assigned a value (its weight). A 5 B C D 12 E Robb T. Koether (Hampden-Sydney College) Street-Routing Problems Wed, Oct 25, / 21

22 Outline 1 Street-Routing Problems 2 Definitions 3 Examples 4 Assignment Robb T. Koether (Hampden-Sydney College) Street-Routing Problems Wed, Oct 25, / 21

23 Example Example (The Security Guard Problem) In the Security Guard Problem, we want a path that traverses every edge at least once and has the minimal total length. Robb T. Koether (Hampden-Sydney College) Street-Routing Problems Wed, Oct 25, / 21

24 Example Example (The Mail Carrier Problem) In the Mail Carrier Problem, we want a path that traverses every edge at least twice (except the boundary) and has the minimal total length. With the duplicated edges, the Mail Carrier Problem is the same as the Security Guard Problem. Robb T. Koether (Hampden-Sydney College) Street-Routing Problems Wed, Oct 25, / 21

25 Example Example (The Bridges of Königsberg Problem) In the Bridges of Königsberg Problem, we want a circuit that traverses each edge exactly once. Robb T. Koether (Hampden-Sydney College) Street-Routing Problems Wed, Oct 25, / 21

26 Example Example (The Bridges of Königsberg Problem) We draw a graph that shows only the relevant parts. Robb T. Koether (Hampden-Sydney College) Street-Routing Problems Wed, Oct 25, / 21

27 Example Example (The Bridges of Madison County Problem) In the Bridges of Madison County Problem, we want a circuit that traverses each edge at least once and has the minimal total length. This is the same as the Security Guard Problem. Robb T. Koether (Hampden-Sydney College) Street-Routing Problems Wed, Oct 25, / 21

28 Example Example (The Bridges of Madison County Problem) In the Bridges of Madison County Problem, we want a circuit that traverses each edge at least once and has the minimal total length. This is the same as the Security Guard Problem. Robb T. Koether (Hampden-Sydney College) Street-Routing Problems Wed, Oct 25, / 21

29 Example Example (The Traveling Salesman Problem) 8 B I 9 A J 9 7 C F 10 6 E 7 D H 9 G In the Traveling Salesman Problem, we want a circuit that visits each vertex at least once and has the minimal total length. Robb T. Koether (Hampden-Sydney College) Street-Routing Problems Wed, Oct 25, / 21

30 Example Example (The Traveling Salesman Problem) A 8 11 B C 10 D 9 I J F 9 14 E 7 H 9 G In the Traveling Salesman Problem, we want a circuit that visits each vertex at least once and has the minimal total length. Robb T. Koether (Hampden-Sydney College) Street-Routing Problems Wed, Oct 25, / 21

31 Outline 1 Street-Routing Problems 2 Definitions 3 Examples 4 Assignment Robb T. Koether (Hampden-Sydney College) Street-Routing Problems Wed, Oct 25, / 21

32 Assignment Assignment Chapter 5: Exercises 2, 3, 7, 13, 15, 19, 20, 21, 22, 27. Robb T. Koether (Hampden-Sydney College) Street-Routing Problems Wed, Oct 25, / 21

Minimal Spanning Trees

Minimal Spanning Trees Minimal Spanning Trees Lecture 33 Sections 7.1-7.3 Robb T. Koether Hampden-Sydney College Wed, Apr 11, 20 Robb T. Koether (Hampden-Sydney College) Minimal Spanning Trees Wed, Apr 11, 20 1 / 17 1 Networks

More information

The Traveling Salesman Problem Brute Force Method

The Traveling Salesman Problem Brute Force Method The Traveling Salesman Problem Brute Force Method Lecture 30 Sections 6.1, 6.3 Robb T. Koether Hampden-Sydney College Fri, Nov 3, 2017 Robb T. Koether (Hampden-Sydney College)The Traveling Salesman Problem

More information

The Critical-Path Algorithm

The Critical-Path Algorithm The Critical-Path Algorithm Lecture 32 Sections 8.3-8.4 Robb T. Koether Hampden-Sydney College Wed, Nov 19, 2014 Robb T. Koether (Hampden-Sydney College) The Critical-Path Algorithm Wed, Nov 19, 2014 1

More information

The Traveling Salesman Problem Nearest-Neighbor Algorithm

The Traveling Salesman Problem Nearest-Neighbor Algorithm The Traveling Salesman Problem Nearest-Neighbor Algorithm Lecture 31 Sections 6.4 Robb T. Koether Hampden-Sydney College Fri, Apr 6, 2018 Robb T. Koether (Hampden-Sydney College)The Traveling Salesman

More information

Rotations and Translations

Rotations and Translations Rotations and Translations Lecture 33 Sections 11.3-11.4 Robb T. Koether Hampden-Sydney College Wed, Nov 20, 2013 Robb T. Koether (Hampden-Sydney College) Rotations and Translations Wed, Nov 20, 2013 1

More information

Recursive Sequences. Lecture 24 Section 5.6. Robb T. Koether. Hampden-Sydney College. Wed, Feb 27, 2013

Recursive Sequences. Lecture 24 Section 5.6. Robb T. Koether. Hampden-Sydney College. Wed, Feb 27, 2013 Recursive Sequences Lecture 24 Section 5.6 Robb T. Koether Hampden-Sydney College Wed, Feb 27, 2013 Robb T. Koether (Hampden-Sydney College) Recursive Sequences Wed, Feb 27, 2013 1 / 21 1 Recursive Sequences

More information

Recursive Sequences. Lecture 24 Section 5.6. Robb T. Koether. Hampden-Sydney College. Wed, Feb 26, 2014

Recursive Sequences. Lecture 24 Section 5.6. Robb T. Koether. Hampden-Sydney College. Wed, Feb 26, 2014 Recursive Sequences Lecture 24 Section 5.6 Robb T. Koether Hampden-Sydney College Wed, Feb 26, 2014 Robb T. Koether (Hampden-Sydney College) Recursive Sequences Wed, Feb 26, 2014 1 / 26 1 Recursive Sequences

More information

Nondeterministic Programming in C++

Nondeterministic Programming in C++ Nondeterministic Programming in C++ Lecture 37 Sections 14.5 Robb T. Koether Hampden-Sydney College Wed, Nov 30, 2016 Robb T. Koether (Hampden-Sydney College) Nondeterministic Programming in C++ Wed, Nov

More information

The Traveling Salesman Problem Cheapest-Link Algorithm

The Traveling Salesman Problem Cheapest-Link Algorithm The Traveling Salesman Problem heapest-link lgorithm Lecture 3 Sections.5 Robb T. Koether ampden-sydney ollege Wed, Nov 1, 201 Robb T. Koether (ampden-sydney ollege)the Traveling Salesman Problemheapest-Link

More information

The Decreasing-Time Algorithm

The Decreasing-Time Algorithm The Decreasing-Time Algorithm Lecture 36 Sections 8.4 Robb T. Koether Hampden-Sydney College Wed, Apr 18, 2018 Robb T. Koether (Hampden-Sydney College) The Decreasing-Time Algorithm Wed, Apr 18, 2018 1

More information

Solving Recursive Sequences by Iteration

Solving Recursive Sequences by Iteration Solving Recursive Sequences by Iteration Lecture 25 Section 5.7 Robb T. Koether Hampden-Sydney College Thu, Feb 28, 2013 Robb T. Koether (Hampden-Sydney College) Solving Recursive Sequences by Iteration

More information

Sampling Distribution Examples Sections 15.4, 15.5

Sampling Distribution Examples Sections 15.4, 15.5 Sampling Distribution Examples Sections 15.4, 15.5 Lecture 27 Robb T. Koether Hampden-Sydney College Wed, Mar 2, 2016 Robb T. Koether (Hampden-Sydney College)Sampling Distribution ExamplesSections 15.4,

More information

Review. Lecture 39. Robb T. Koether. Mon, Dec 5, Hampden-Sydney College. Robb T. Koether (Hampden-Sydney College) Review Mon, Dec 5, / 14

Review. Lecture 39. Robb T. Koether. Mon, Dec 5, Hampden-Sydney College. Robb T. Koether (Hampden-Sydney College) Review Mon, Dec 5, / 14 Review Lecture 39 Robb T. Koether Hampden-Sydney College Mon, Dec 5, 2016 Robb T. Koether (Hampden-Sydney College) Review Mon, Dec 5, 2016 1 / 14 1 The Exam Test #2 Test #3 Robb T. Koether (Hampden-Sydney

More information

Boxplots. Lecture 17 Section Robb T. Koether. Hampden-Sydney College. Wed, Feb 10, 2010

Boxplots. Lecture 17 Section Robb T. Koether. Hampden-Sydney College. Wed, Feb 10, 2010 Boxplots Lecture 17 Section 5.3.3 Robb T. Koether Hampden-Sydney College Wed, Feb 10, 2010 Robb T. Koether (Hampden-Sydney College) Boxplots Wed, Feb 10, 2010 1 / 34 Outline 1 Boxplots TI-83 Boxplots 2

More information

Scope and Parameter Passing

Scope and Parameter Passing Scope and Parameter Passing Lecture 16 Sections 6.5, 6.10, 6.13 Robb T. Koether Hampden-Sydney College Mon, Oct 7, 2013 Robb T. Koether (Hampden-Sydney College) Scope and Parameter Passing Mon, Oct 7,

More information

Recursive Descent Parsers

Recursive Descent Parsers Recursive Descent Parsers Lecture 7 Robb T. Koether Hampden-Sydney College Wed, Jan 28, 2015 Robb T. Koether (Hampden-Sydney College) Recursive Descent Parsers Wed, Jan 28, 2015 1 / 18 1 Parsing 2 LL Parsers

More information

while Loops Lecture 13 Sections Robb T. Koether Wed, Sep 26, 2018 Hampden-Sydney College

while Loops Lecture 13 Sections Robb T. Koether Wed, Sep 26, 2018 Hampden-Sydney College while Loops Lecture 13 Sections 5.8-5.9 Robb T. Koether Hampden-Sydney College Wed, Sep 26, 2018 Robb T. Koether (Hampden-Sydney College) while Loops Wed, Sep 26, 2018 1 / 25 1 while Loops 2 Input Loops

More information

Stack Applications. Lecture 27 Sections Robb T. Koether. Hampden-Sydney College. Wed, Mar 29, 2017

Stack Applications. Lecture 27 Sections Robb T. Koether. Hampden-Sydney College. Wed, Mar 29, 2017 Stack Applications Lecture 27 Sections 18.7-18.8 Robb T. Koether Hampden-Sydney College Wed, Mar 29, 2017 Robb T. Koether Hampden-Sydney College) Stack Applications Wed, Mar 29, 2017 1 / 27 1 Function

More information

The Class Construct Part 1

The Class Construct Part 1 The Class Construct Part 1 Lecture 23 Sections 7.5-7.6 Robb T. Koether Hampden-Sydney College Fri, Oct 26, 2018 Robb T. Koether (Hampden-Sydney College) The Class Construct Part 1 Fri, Oct 26, 2018 1 /

More information

The Graphics Pipeline

The Graphics Pipeline The Graphics Pipeline Lecture 2 Robb T. Koether Hampden-Sydney College Wed, Aug 23, 2017 Robb T. Koether (Hampden-Sydney College) The Graphics Pipeline Wed, Aug 23, 2017 1 / 19 Outline 1 Vertices 2 The

More information

Scheduling and Digraphs

Scheduling and Digraphs Scheduling and Digraphs Lecture 35 Sections 8.1, 8.2 Robb T. Koether Hampden-Sydney College Mon, Nov 21, 2016 Robb T. Koether (Hampden-Sydney College) Scheduling and Digraphs Mon, Nov 21, 2016 1 / 25 1

More information

The Pairwise-Comparison Method

The Pairwise-Comparison Method The Pairwise-Comparison Method Lecture 10 Section 1.5 Robb T. Koether Hampden-Sydney College Mon, Sep 11, 2017 Robb T. Koether (Hampden-Sydney College) The Pairwise-Comparison Method Mon, Sep 11, 2017

More information

Scope and Parameter Passing

Scope and Parameter Passing Scope and Parameter Passing Lecture 17 Sections 6.5, 6.10, 6.13 Robb T. Koether Hampden-Sydney College Fri, Oct 5, 2018 Robb T. Koether (Hampden-Sydney College) Scope and Parameter Passing Fri, Oct 5,

More information

Displaying Distributions - Quantitative Variables

Displaying Distributions - Quantitative Variables Displaying Distributions - Quantitative Variables Lecture 13 Sections 4.4.1-4.4.3 Robb T. Koether Hampden-Sydney College Wed, Feb 8, 2012 Robb T. Koether (Hampden-Sydney College)Displaying Distributions

More information

The Plurality-with-Elimination Method

The Plurality-with-Elimination Method The Plurality-with-Elimination Method Lecture 9 Section 1.4 Robb T. Koether Hampden-Sydney College Fri, Sep 8, 2017 Robb T. Koether (Hampden-Sydney College) The Plurality-with-Elimination Method Fri, Sep

More information

Recursion. Lecture 2 Sections Robb T. Koether. Hampden-Sydney College. Wed, Jan 17, 2018

Recursion. Lecture 2 Sections Robb T. Koether. Hampden-Sydney College. Wed, Jan 17, 2018 Recursion Lecture 2 Sections 20.1-20.4 Robb T. Koether Hampden-Sydney College Wed, Jan 17, 2018 Robb T. Koether (Hampden-Sydney College) Recursion Wed, Jan 17, 2018 1 / 18 1 Recursion 2 Advantages and

More information

Chapter 5: The Mathematics of Getting Around

Chapter 5: The Mathematics of Getting Around Euler Paths and Circuits Chapter 5: The Mathematics of Getting Around 5.1 Street-Routing Problem Our story begins in the 1700s in the medieval town of Königsberg, in Eastern Europe. At the time, Königsberg

More information

Boolean Expressions. Lecture 31 Sections 6.6, 6.7. Robb T. Koether. Hampden-Sydney College. Wed, Apr 8, 2015

Boolean Expressions. Lecture 31 Sections 6.6, 6.7. Robb T. Koether. Hampden-Sydney College. Wed, Apr 8, 2015 Boolean Expressions Lecture 31 Sections 6.6, 6.7 Robb T. Koether Hampden-Sydney College Wed, Apr 8, 2015 Robb T. Koether (Hampden-Sydney College) Boolean Expressions Wed, Apr 8, 2015 1 / 22 1 Relational

More information

Binary Tree Applications

Binary Tree Applications Binary Tree Applications Lecture 30 Section 19.2 Robb T. Koether Hampden-Sydney College Wed, Apr 15, 2015 Robb T. Koether (Hampden-Sydney College) Binary Tree Applications Wed, Apr 15, 2015 1 / 56 1 Binary

More information

The CYK Parsing Algorithm

The CYK Parsing Algorithm The CYK Parsing Algorithm Lecture 19 Section 6.3 Robb T. Koether Hampden-Sydney College Fri, Oct 7, 2016 Robb T. Koether (Hampden-Sydney College) The CYK Parsing Algorithm Fri, Oct 7, 2016 1 / 21 1 The

More information

Abstract Data Types. Lecture 23 Section 7.1. Robb T. Koether. Hampden-Sydney College. Wed, Oct 24, 2012

Abstract Data Types. Lecture 23 Section 7.1. Robb T. Koether. Hampden-Sydney College. Wed, Oct 24, 2012 Abstract Data Types Lecture 23 Section 7.1 Robb T. Koether Hampden-Sydney College Wed, Oct 24, 2012 Robb T. Koether (Hampden-Sydney College) Abstract Data Types Wed, Oct 24, 2012 1 / 19 1 Abstract Data

More information

Regular Expressions. Lecture 10 Sections Robb T. Koether. Hampden-Sydney College. Wed, Sep 14, 2016

Regular Expressions. Lecture 10 Sections Robb T. Koether. Hampden-Sydney College. Wed, Sep 14, 2016 Regular Expressions Lecture 10 Sections 3.1-3.2 Robb T. Koether Hampden-Sydney College Wed, Sep 14, 2016 Robb T. Koether (Hampden-Sydney College) Regular Expressions Wed, Sep 14, 2016 1 / 23 Outline 1

More information

Pointers. Lecture 1 Sections Robb T. Koether. Hampden-Sydney College. Wed, Jan 14, 2015

Pointers. Lecture 1 Sections Robb T. Koether. Hampden-Sydney College. Wed, Jan 14, 2015 Pointers Lecture 1 Sections 10.1-10.2 Robb T. Koether Hampden-Sydney College Wed, Jan 14, 2015 Robb T. Koether (Hampden-Sydney College) Pointers Wed, Jan 14, 2015 1 / 23 1 Pointers 2 Pointer Initialization

More information

XPath. Lecture 36. Robb T. Koether. Wed, Apr 16, Hampden-Sydney College. Robb T. Koether (Hampden-Sydney College) XPath Wed, Apr 16, / 28

XPath. Lecture 36. Robb T. Koether. Wed, Apr 16, Hampden-Sydney College. Robb T. Koether (Hampden-Sydney College) XPath Wed, Apr 16, / 28 XPath Lecture 36 Robb T. Koether Hampden-Sydney College Wed, Apr 16, 2014 Robb T. Koether (Hampden-Sydney College) XPath Wed, Apr 16, 2014 1 / 28 1 XPath 2 Executing XPath Expressions 3 XPath Expressions

More information

The Normal Distribution

The Normal Distribution The Normal Distribution Lecture 20 Section 6.3.1 Robb T. Koether Hampden-Sydney College Wed, Sep 28, 2011 Robb T. Koether (Hampden-Sydney College) The Normal Distribution Wed, Sep 28, 2011 1 / 41 Outline

More information

The string Class. Lecture 21 Sections 2.9, 3.9, Robb T. Koether. Wed, Oct 17, Hampden-Sydney College

The string Class. Lecture 21 Sections 2.9, 3.9, Robb T. Koether. Wed, Oct 17, Hampden-Sydney College The string Class Lecture 21 Sections 2.9, 3.9, 3.10 Robb T. Koether Hampden-Sydney College Wed, Oct 17, 2018 Robb T. Koether (Hampden-Sydney College) The string Class Wed, Oct 17, 2018 1 / 18 1 The String

More information

The Coefficient of Determination

The Coefficient of Determination The Coefficient of Determination Lecture 46 Section 13.9 Robb T. Koether Hampden-Sydney College Wed, Apr 17, 2012 Robb T. Koether (Hampden-Sydney College) The Coefficient of Determination Wed, Apr 17,

More information

Density Curves Sections

Density Curves Sections Density Curves Sections 3.1-3.2 Lecture 8 Robb T. Koether Hampden-Sydney College Wed, Jan 27, 2016 Robb T. Koether (Hampden-Sydney College) Density CurvesSections 3.1-3.2 Wed, Jan 27, 2016 1 / 18 Outline

More information

Introduction to Databases

Introduction to Databases Introduction to Databases Lecture 1 Chapters 1-2 Robb T. Koether Hampden-Sydney College Wed, Jan 15, 2014 Robb T. Koether (Hampden-Sydney College) Introduction to Databases Wed, Jan 15, 2014 1 / 23 1 Overview

More information

Specular Reflection. Lecture 19. Robb T. Koether. Hampden-Sydney College. Wed, Oct 4, 2017

Specular Reflection. Lecture 19. Robb T. Koether. Hampden-Sydney College. Wed, Oct 4, 2017 Specular Reflection Lecture 19 Robb T. Koether Hampden-Sydney College Wed, Oct 4, 2017 Robb T. Koether (Hampden-Sydney College) Specular Reflection Wed, Oct 4, 2017 1 / 22 Outline 1 Specular Reflection

More information

The Graphics Pipeline

The Graphics Pipeline The Graphics Pipeline Lecture 2 Robb T. Koether Hampden-Sydney College Fri, Aug 28, 2015 Robb T. Koether (Hampden-Sydney College) The Graphics Pipeline Fri, Aug 28, 2015 1 / 19 Outline 1 Vertices 2 The

More information

MATH 101: Introduction to Contemporary Mathematics

MATH 101: Introduction to Contemporary Mathematics MATH 101: Introduction to Contemporary Mathematics Sections 201-206 Instructor: H. R. Hughes Course web page: http://www.math.siu.edu/hughes/math101.htm Summer 2013 Lecture sessions meet: MTWF 12:10-1:10

More information

Chapter 5: Euler Paths and Circuits The Mathematics of Getting Around

Chapter 5: Euler Paths and Circuits The Mathematics of Getting Around 1 Finite Math A Chapter 5: Euler Paths and Circuits The Mathematics of Getting Around Academic Standards Covered in this Chapter: *************************************************************************************

More information

XPath Lecture 34. Robb T. Koether. Hampden-Sydney College. Wed, Apr 11, 2012

XPath Lecture 34. Robb T. Koether. Hampden-Sydney College. Wed, Apr 11, 2012 XPath Lecture 34 Robb T. Koether Hampden-Sydney College Wed, Apr 11, 2012 Robb T. Koether (Hampden-Sydney College) XPathLecture 34 Wed, Apr 11, 2012 1 / 20 1 XPath Functions 2 Predicates 3 Axes Robb T.

More information

Chapter 5: Euler Paths and Circuits The Mathematics of Getting Around

Chapter 5: Euler Paths and Circuits The Mathematics of Getting Around 1 Finite Math A Chapter 5: Euler Paths and Circuits The Mathematics of Getting Around Academic Standards Covered in this Chapter: *************************************************************************************

More information

Linked Lists. Lecture 16 Sections Robb T. Koether. Hampden-Sydney College. Wed, Feb 22, 2017

Linked Lists. Lecture 16 Sections Robb T. Koether. Hampden-Sydney College. Wed, Feb 22, 2017 Linked Lists Lecture 16 Sections 17.1-17.3 Robb T. Koether Hampden-Sydney College Wed, Feb 22, 2017 Robb T. Koether (Hampden-Sydney College) Linked Lists Wed, Feb 22, 2017 1 / 24 1 Linked Lists 2 The LinkedListNode

More information

Building the Abstract Syntax Trees

Building the Abstract Syntax Trees Building the Abstract Syntax Trees Lecture 23 Section 5.3 Robb T. Koether Hampden-Sydney College Wed, Mar 18, 2015 Robb T. Koether (Hampden-Sydney College) Building the Abstract Syntax Trees Wed, Mar 18,

More information

Implementing Linked Lists

Implementing Linked Lists Implementing Linked Lists Lecture 16 Sections 17.1-17.3 Robb T. Koether Hampden-Sydney College Wed, Feb 27, 2013 Robb T. Koether (Hampden-Sydney College) Implementing Linked Lists Wed, Feb 27, 2013 1 /

More information

LR Parsing - Conflicts

LR Parsing - Conflicts LR Parsing - Conflicts Lecture 15 Sections 4.5, 4.6 Robb T. Koether Hampden-Sydney College Fri, Feb 20, 2015 Robb T. Koether (Hampden-Sydney College) LR Parsing - Conflicts Fri, Feb 20, 2015 1 / 15 1 Shift/Reduce

More information

Junior Circle Meeting 3 Circuits and Paths. April 18, 2010

Junior Circle Meeting 3 Circuits and Paths. April 18, 2010 Junior Circle Meeting 3 Circuits and Paths April 18, 2010 We have talked about insect worlds which consist of cities connected by tunnels. Here is an example of an insect world (Antland) which we saw last

More information

Total Orders. Lecture 41 Section 8.5. Robb T. Koether. Hampden-Sydney College. Mon, Apr 8, 2013

Total Orders. Lecture 41 Section 8.5. Robb T. Koether. Hampden-Sydney College. Mon, Apr 8, 2013 Total Orders Lecture 41 Section 8.5 Robb T. Koether Hampden-Sydney College Mon, Apr 8, 2013 Robb T. Koether (Hampden-Sydney College) Total Orders Mon, Apr 8, 2013 1 / 30 1 Total Orders 2 Topological Sorting

More information

Introduction to Compiler Design

Introduction to Compiler Design Introduction to Compiler Design Lecture 1 Chapters 1 and 2 Robb T. Koether Hampden-Sydney College Wed, Jan 14, 2015 Robb T. Koether (Hampden-Sydney College) Introduction to Compiler Design Wed, Jan 14,

More information

Sections 5.2, 5.3. & 5.4

Sections 5.2, 5.3. & 5.4 MATH 11008: Graph Theory Terminology Sections 5.2, 5.3. & 5.4 Routing problem: A routing problem is concerned with finding ways to route the delivery of good and/or services to an assortment of destinations.

More information

Chapter 14 Section 3 - Slide 1

Chapter 14 Section 3 - Slide 1 AND Chapter 14 Section 3 - Slide 1 Chapter 14 Graph Theory Chapter 14 Section 3 - Slide WHAT YOU WILL LEARN Graphs, paths and circuits The Königsberg bridge problem Euler paths and Euler circuits Hamilton

More information

The Projection Matrix

The Projection Matrix The Projection Matrix Lecture 5 Robb T. Koether Hampden-Sydney College Wed, Aug 30, 2017 Robb T. Koether (Hampden-Sydney College) The Projection Matrix Wed, Aug 30, 2017 1 / 21 Outline 1 The World Coordinate

More information

An Interactive Introduction to Graph Theory

An Interactive Introduction to Graph Theory An Interactive Introduction to Graph Theory An Interactive Introduction to Graph Theory Chris K. Caldwell 1995 This the first of a series of interactive tutorials introducing the basic concepts of graph

More information

Mipmaps. Lecture 35. Robb T. Koether. Hampden-Sydney College. Wed, Nov 18, 2015

Mipmaps. Lecture 35. Robb T. Koether. Hampden-Sydney College. Wed, Nov 18, 2015 Mipmaps Lecture 35 Robb T. Koether Hampden-Sydney College Wed, Nov 18, 2015 Robb T. Koether (Hampden-Sydney College) Mipmaps Wed, Nov 18, 2015 1 / 31 Outline 1 Discrete Sampling 2 Mipmaps 3 Generating

More information

Magnification and Minification

Magnification and Minification Magnification and Minification Lecture 30 Robb T. Koether Hampden-Sydney College Fri, Nov 6, 2015 Robb T. Koether (Hampden-Sydney College) Magnification and Minification Fri, Nov 6, 2015 1 / 17 Outline

More information

PHP Queries and HTML Forms Lecture 23

PHP Queries and HTML Forms Lecture 23 PHP Queries and HTML Forms Lecture 23 Robb T. Koether Hampden-Sydney College Wed, Mar 14, 2018 Robb T. Koether (Hampden-Sydney College) PHP Queries and HTML FormsLecture 23 Wed, Mar 14, 2018 1 / 15 1 Retrieving

More information

Ambient and Diffuse Light

Ambient and Diffuse Light Ambient and Diffuse Light Lecture 20 Robb T. Koether Hampden-Sydney College Mon, Oct 12, 2015 Robb T. Koether (Hampden-Sydney College) Ambient and Diffuse Light Mon, Oct 12, 2015 1 / 29 Outline 1 Lighting

More information

XML Attributes. Lecture 33. Robb T. Koether. Hampden-Sydney College. Wed, Apr 25, 2018

XML Attributes. Lecture 33. Robb T. Koether. Hampden-Sydney College. Wed, Apr 25, 2018 XML Attributes Lecture 33 Robb T. Koether Hampden-Sydney College Wed, Apr 25, 2018 Robb T. Koether (Hampden-Sydney College) XML Attributes Wed, Apr 25, 2018 1 / 15 1 XML Attributes 2 The getattribute()

More information

Recognition of Tokens

Recognition of Tokens Recognition of Tokens Lecture 3 Section 3.4 Robb T. Koether Hampden-Sydney College Mon, Jan 19, 2015 Robb T. Koether (Hampden-Sydney College) Recognition of Tokens Mon, Jan 19, 2015 1 / 21 1 A Class of

More information

Precept 4: Traveling Salesman Problem, Hierarchical Clustering. Qian Zhu 2/23/2011

Precept 4: Traveling Salesman Problem, Hierarchical Clustering. Qian Zhu 2/23/2011 Precept 4: Traveling Salesman Problem, Hierarchical Clustering Qian Zhu 2/23/2011 Agenda Assignment: Traveling salesman problem Hierarchical clustering Example Comparisons with K-means TSP TSP: Given the

More information

Function Usage. Lecture 15 Sections 6.3, 6.4. Robb T. Koether. Hampden-Sydney College. Mon, Oct 1, 2018

Function Usage. Lecture 15 Sections 6.3, 6.4. Robb T. Koether. Hampden-Sydney College. Mon, Oct 1, 2018 Function Usage Lecture 15 Sections 6.3, 6.4 Robb T. Koether Hampden-Sydney College Mon, Oct 1, 2018 Robb T. Koether (Hampden-Sydney College) Function Usage Mon, Oct 1, 2018 1 / 12 1 Function and Parameters

More information

14.2 Euler Paths and Circuits filled in.notebook November 18, Euler Paths and Euler Circuits

14.2 Euler Paths and Circuits filled in.notebook November 18, Euler Paths and Euler Circuits 14.2 Euler Paths and Euler Circuits The study of graph theory can be traced back to the eighteenth century when the people of the town of Konigsberg sought a solution to a popular problem. They had sections

More information

Pointer Arithmetic. Lecture 4 Chapter 10. Robb T. Koether. Hampden-Sydney College. Wed, Jan 25, 2017

Pointer Arithmetic. Lecture 4 Chapter 10. Robb T. Koether. Hampden-Sydney College. Wed, Jan 25, 2017 Pointer Arithmetic Lecture 4 Chapter 10 Robb T. Koether Hampden-Sydney College Wed, Jan 25, 2017 Robb T. Koether (Hampden-Sydney College) Pointer Arithmetic Wed, Jan 25, 2017 1 / 36 1 Pointer Arithmetic

More information

Stack Applications. Lecture 25 Sections Robb T. Koether. Hampden-Sydney College. Mon, Mar 30, 2015

Stack Applications. Lecture 25 Sections Robb T. Koether. Hampden-Sydney College. Mon, Mar 30, 2015 Stack Applications Lecture 25 Sections 18.7-18.8 Robb T. Koether Hampden-Sydney College Mon, Mar 30, 2015 Robb T. Koether Hampden-Sydney College) Stack Applications Mon, Mar 30, 2015 1 / 34 1 The Triangle

More information

Section Graphs, Paths, and Circuits. Copyright 2013, 2010, 2007, Pearson, Education, Inc.

Section Graphs, Paths, and Circuits. Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 14.1 Graphs, Paths, and Circuits What You Will Learn Graphs Paths Circuits Bridges 14.1-2 Definitions A graph is a finite set of points called vertices (singular form is vertex) connected by line

More information

Function Definition Syntax Tree

Function Definition Syntax Tree Function Definition Syntax Tree Lecture 34 Section 6.9 Robb T. Koether Hampden-Sydney College Wed, Apr 15, 2015 Robb T. Koether (Hampden-Sydney College) Function Definition Syntax Tree Wed, Apr 15, 2015

More information

Introduction to Databases

Introduction to Databases Introduction to Databases Lecture 1 Robb T. Koether Hampden-Sydney College Mon, Jan 15, 2018 Robb T. Koether (Hampden-Sydney College) Introduction to Databases Mon, Jan 15, 2018 1 / 16 1 Overview of the

More information

AQR UNIT 7. Circuits, Paths, and Graph Structures. Packet #

AQR UNIT 7. Circuits, Paths, and Graph Structures. Packet # AQR UNIT 7 NETWORKS AND GRAPHS: Circuits, Paths, and Graph Structures Packet # BY: Introduction to Networks and Graphs: Try drawing a path for a person to walk through each door exactly once without going

More information

Aggregation. Lecture 7 Section Robb T. Koether. Hampden-Sydney College. Wed, Jan 29, 2014

Aggregation. Lecture 7 Section Robb T. Koether. Hampden-Sydney College. Wed, Jan 29, 2014 Aggregation Lecture 7 Section 5.1.7-5.1.8 Robb T. Koether Hampden-Sydney College Wed, Jan 29, 2014 Robb T. Koether (Hampden-Sydney College) Aggregation Wed, Jan 29, 2014 1 / 17 1 Aggregate Functions 2

More information

Sarah Will Math 490 December 2, 2009

Sarah Will Math 490 December 2, 2009 Sarah Will Math 490 December 2, 2009 Euler Circuits INTRODUCTION Euler wrote the first paper on graph theory. It was a study and proof that it was impossible to cross the seven bridges of Königsberg once

More information

Recursive Linked Lists

Recursive Linked Lists Recursive Linked Lists Lecture 28 Sections 14.1-14.5, 14.7 Robb T. Koether Hampden-Sydney College Fri, Mar 31, 2017 Robb T. Koether (Hampden-Sydney College) Recursive Linked Lists Fri, Mar 31, 2017 1 /

More information

Graph theory was invented by a mathematician named Euler in the 18th century. We will see some of the problems which motivated its study.

Graph theory was invented by a mathematician named Euler in the 18th century. We will see some of the problems which motivated its study. Graph Theory Graph theory was invented by a mathematician named Euler in the 18th century. We will see some of the problems which motivated its study. However, it wasn t studied too systematically until

More information

Operators. Lecture 12 Section Robb T. Koether. Hampden-Sydney College. Fri, Feb 9, 2018

Operators. Lecture 12 Section Robb T. Koether. Hampden-Sydney College. Fri, Feb 9, 2018 Operators Lecture 12 Section 14.5 Robb T. Koether Hampden-Sydney College Fri, Feb 9, 2018 Robb T. Koether (Hampden-Sydney College) Operators Fri, Feb 9, 2018 1 / 21 Outline 1 Operators as Functions 2 Operator

More information

MATH 113 Section 9.2: Topology

MATH 113 Section 9.2: Topology MATH 113 Section 9.2: Topology Prof. Jonathan Duncan Walla Walla College Winter Quarter, 2007 Outline 1 Introduction to Topology 2 Topology and Childrens Drawings 3 Networks 4 Conclusion Geometric Topology

More information

List Iterator Implementation

List Iterator Implementation List Iterator Implementation Lecture 28 Section 14.6 Robb T. Koether Hampden-Sydney College Fri, Apr 10, 2015 Robb T. Koether (Hampden-Sydney College) List Iterator Implementation Fri, Apr 10, 2015 1 /

More information

The Model Stack. Lecture 8. Robb T. Koether. Hampden-Sydney College. Wed, Sep 6, 2017

The Model Stack. Lecture 8. Robb T. Koether. Hampden-Sydney College. Wed, Sep 6, 2017 The Model Stack Lecture 8 Robb T. Koether Hampden-Sydney College Wed, Sep 6, 2017 Robb T. Koether (Hampden-Sydney College) The Model Stack Wed, Sep 6, 2017 1 / 19 Outline 1 Drawing Rectangle Man 2 The

More information

Relational Databases Lecture 2

Relational Databases Lecture 2 Relational Databases Lecture 2 Robb T Koether Hampden-Sydney College Fri, Jan 20, 2012 Robb T Koether (Hampden-Sydney College) Relational DatabasesLecture 2 Fri, Jan 20, 2012 1 / 36 1 Databases Systems

More information

The Mesh Class. Lecture 26. Robb T. Koether. Wed, Oct 28, Hampden-Sydney College

The Mesh Class. Lecture 26. Robb T. Koether. Wed, Oct 28, Hampden-Sydney College The Mesh Class Lecture 26 Robb T. Koether Hampden-Sydney College Wed, Oct 28, 2015 Robb T. Koether (Hampden-Sydney College) The Mesh Class Wed, Oct 28, 2015 1 / 23 Outline 1 The Mesh Class 2 Assignment

More information

Recursion. Lecture 26 Sections , Robb T. Koether. Hampden-Sydney College. Mon, Apr 6, 2015

Recursion. Lecture 26 Sections , Robb T. Koether. Hampden-Sydney College. Mon, Apr 6, 2015 Recursion Lecture 26 Sections 14.1-14.5, 14.7 Robb T. Koether Hampden-Sydney College Mon, Apr 6, 2015 Robb T. Koether (Hampden-Sydney College) Recursion Mon, Apr 6, 2015 1 / 18 1 Recursion 2 Advantages

More information

Shading Triangles. Lecture 37. Robb T. Koether. Hampden-Sydney College. Mon, Nov 30, 2015

Shading Triangles. Lecture 37. Robb T. Koether. Hampden-Sydney College. Mon, Nov 30, 2015 Shading Triangles Lecture 37 Robb T. Koether Hampden-Sydney College Mon, Nov 30, 2015 Robb T. Koether (Hampden-Sydney College) Shading Triangles Mon, Nov 30, 2015 1 / 35 Outline 1 Shading Triangles Barycentric

More information

Networks and Graphs: Circuits, Paths, and Graph Structures VII.A Student Activity Sheet 1: Euler Circuits and Paths

Networks and Graphs: Circuits, Paths, and Graph Structures VII.A Student Activity Sheet 1: Euler Circuits and Paths The Königsberg Bridge Problem The following figure shows the rivers and bridges of Königsberg. Residents of the city occupied themselves by trying to find a walking path through the city that began and

More information

Networks and Graphs: Circuits, Paths, and Graph Structures VII.A Student Activity Sheet 1: Euler Circuits and Paths

Networks and Graphs: Circuits, Paths, and Graph Structures VII.A Student Activity Sheet 1: Euler Circuits and Paths The Königsberg Bridge Problem The following figure shows the rivers and bridges of Königsberg. Residents of the city occupied themselves by trying to find a walking path through the city that began and

More information

Friends and Unary Operators

Friends and Unary Operators Friends and Unary Operators Lecture 11 Sections 11.3, 11.6 Robb T. Koether Hampden-Sydney College Fri, Feb 13, 2015 Robb T. Koether (Hampden-Sydney College) Friends and Unary Operators Fri, Feb 13, 2015

More information

Introduction to Networks

Introduction to Networks LESSON 1 Introduction to Networks Exploratory Challenge 1 One classic math puzzle is the Seven Bridges of Königsberg problem which laid the foundation for networks and graph theory. In the 18th century

More information

Section Graphs, Paths, and Circuits. Copyright 2013, 2010, 2007, Pearson, Education, Inc.

Section Graphs, Paths, and Circuits. Copyright 2013, 2010, 2007, Pearson, Education, Inc. Section 14.1 Graphs, Paths, and Circuits INB Table of Contents Date Topic Page # January 27, 2014 Test #1 14 January 27, 2014 Test # 1 Corrections 15 January 27, 2014 Section 14.1 Examples 16 January 27,

More information

Graph Theory

Graph Theory Graph Theory 2012.04.18 Our goal today is to learn some basic concepts in graph theory and explore fun problems using graph theory. A graph is a mathematical object that captures the notion of connection.

More information

Webpage Navigation. Lecture 27. Robb T. Koether. Hampden-Sydney College. Mon, Apr 2, 2018

Webpage Navigation. Lecture 27. Robb T. Koether. Hampden-Sydney College. Mon, Apr 2, 2018 Webpage Navigation Lecture 27 Robb T. Koether Hampden-Sydney College Mon, Apr 2, 2018 Robb T. Koether (Hampden-Sydney College) Webpage Navigation Mon, Apr 2, 2018 1 / 16 1 Popup Boxes 2 The Document Object

More information

The Mesh Class. Lecture 23. Robb T. Koether. Hampden-Sydney College. Wed, Oct 18, 2017

The Mesh Class. Lecture 23. Robb T. Koether. Hampden-Sydney College. Wed, Oct 18, 2017 The Mesh Class Lecture 23 Robb T. Koether Hampden-Sydney College Wed, Oct 18, 2017 Robb T. Koether (Hampden-Sydney College) The Mesh Class Wed, Oct 18, 2017 1 / 21 Outline 1 The Mesh Class 2 Assignment

More information

Vertex-Edge Graphs. Vertex-Edge Graphs In the Georgia Performance Standards. Sarah Holliday Southern Polytechnic State University

Vertex-Edge Graphs. Vertex-Edge Graphs In the Georgia Performance Standards. Sarah Holliday Southern Polytechnic State University Vertex-Edge Graphs Vertex-Edge Graphs In the Georgia Performance Standards Sarah Holliday Southern Polytechnic State University Math III MM3A7. Students will understand and apply matrix representations

More information

The Class Construct Part 2

The Class Construct Part 2 The Class Construct Part 2 Lecture 24 Sections 7.7-7.9 Robb T. Koether Hampden-Sydney College Mon, Oct 29, 2018 Robb T. Koether (Hampden-Sydney College) The Class Construct Part 2 Mon, Oct 29, 2018 1 /

More information

INTRODUCTION TO GRAPH THEORY. 1. Definitions

INTRODUCTION TO GRAPH THEORY. 1. Definitions INTRODUCTION TO GRAPH THEORY D. JAKOBSON 1. Definitions A graph G consists of vertices {v 1, v 2,..., v n } and edges {e 1, e 2,..., e m } connecting pairs of vertices. An edge e = (uv) is incident with

More information

Form Validation. Lecture 25. Robb T. Koether. Hampden-Sydney College. Wed, Mar 23, 2018

Form Validation. Lecture 25. Robb T. Koether. Hampden-Sydney College. Wed, Mar 23, 2018 Form Validation Lecture 25 Robb T. Koether Hampden-Sydney College Wed, Mar 23, 2018 Robb T. Koether (Hampden-Sydney College) Form Validation Wed, Mar 23, 2018 1 / 16 1 Form Validation 2 Detecting Javascript

More information

Introduction to Engineering Systems, ESD.00. Networks. Lecturers: Professor Joseph Sussman Dr. Afreen Siddiqi TA: Regina Clewlow

Introduction to Engineering Systems, ESD.00. Networks. Lecturers: Professor Joseph Sussman Dr. Afreen Siddiqi TA: Regina Clewlow Introduction to Engineering Systems, ESD.00 Lecture 7 Networks Lecturers: Professor Joseph Sussman Dr. Afreen Siddiqi TA: Regina Clewlow The Bridges of Königsberg The town of Konigsberg in 18 th century

More information

The x86 Instruction Set

The x86 Instruction Set The x86 Instruction Set Lecture 25 Intel Manual, Vols. 2A & 2B Robb T. Koether Hampden-Sydney College Mon, Mar 23, 2015 Robb T. Koether (Hampden-Sydney College) The x86 Instruction Set Mon, Mar 23, 2015

More information

Inheritance: The Fundamental Functions

Inheritance: The Fundamental Functions Inheritance: The Fundamental Functions Lecture 21 Sections 11.11-11.12 Robb T. Koether Hampden-Sydney College Wed, Mar 20, 2013 Robb T. Koether (Hampden-Sydney College) Inheritance: The Fundamental Functions

More information

XQuery FLOWR Expressions Lecture 35

XQuery FLOWR Expressions Lecture 35 XQuery FLOWR Expressions Lecture 35 Robb T. Koether Hampden-Sydney College Fri, Apr 13, 2012 Robb T. Koether (Hampden-Sydney College) XQuery FLOWR ExpressionsLecture 35 Fri, Apr 13, 2012 1 / 33 1 XQuery

More information

Math 443/543 Graph Theory Notes 2: Transportation problems

Math 443/543 Graph Theory Notes 2: Transportation problems Math 443/543 Graph Theory Notes 2: Transportation problems David Glickenstein September 15, 2014 1 Readings This is based on Chartrand Chapter 3 and Bondy-Murty 18.1, 18.3 (part on Closure of a Graph).

More information