© Nuffield Foundation 2012 Nuffield Free-Standing Mathematics Activity Networks © Rudolf Stricker.

Slides:

Advertisements

Similar presentations

CSE 211 Discrete Mathematics

Advertisements

* Bellman-Ford: single-source shortest distance * O(VE) for graphs with negative edges * Detects negative weight cycles * Floyd-Warshall: All pairs shortest.

22C:19 Discrete Math Graphs Fall 2010 Sukumar Ghosh.

© Nuffield Foundation 2012 Nuffield Free-Standing Mathematics Activity Modelling a test drive © Rudolf Stricker.

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.

Liang, Introduction to Java Programming, Seventh Edition, (c) 2009 Pearson Education, Inc. All rights reserved Chapter 27 Graph Applications.

Graphs Chapter 30 Carrano, Data Structures and Abstractions with Java, Second Edition, (c) 2007 Pearson Education, Inc. All rights reserved X.

Graphs By JJ Shepherd. Introduction Graphs are simply trees with looser restrictions – You can have cycles Historically hard to deal with in computers.

Graph theory at work.  Examine the procedure utilized by snow plows in Iowa City  Systemize and minimize routes  Review mathematical concepts involved.

Chapter 9 Graph algorithms Lec 21 Dec 1, Sample Graph Problems Path problems. Connectedness problems. Spanning tree problems.

Chapter 4 Graphs.

GRAPH Learning Outcomes Students should be able to:

Chapter 9 – Graphs A graph G=(V,E) – vertices and edges

Computer Science 112 Fundamentals of Programming II Introduction to Graphs.

Graph Theoretic Concepts. What is a graph? A set of vertices (or nodes) linked by edges Mathematically, we often write G = (V,E)  V: set of vertices,

Graph Dr. Bernard Chen Ph.D. University of Central Arkansas.

GRAPHS CSE, POSTECH. Chapter 16 covers the following topics Graph terminology: vertex, edge, adjacent, incident, degree, cycle, path, connected component,

© Nuffield Foundation 2011 Nuffield Free-Standing Mathematics Activity Chinese postman problems What route can I take to avoid going along the same street.

Which of these can be drawn without taking your pencil off the paper and without going over the same line twice? If we can find a path that goes over all.

Structures 7 Decision Maths: Graph Theory, Networks and Algorithms.

7.1 and 7.2: Spanning Trees. A network is a graph that is connected –The network must be a sub-graph of the original graph (its edges must come from the.

Module 5 – Networks and Decision Mathematics Chapter 23 – Undirected Graphs.

1 CS104 : Discrete Structures Chapter V Graph Theory.

Graphs.  Definition A simple graph G= (V, E) consists of vertices, V, a nonempty set of vertices, and E, a set of unordered pairs of distinct elements.

Fundamental Data Structures and Algorithms (Spring ’05) Recitation Notes: Graphs Slides prepared by Uri Dekel, Based on recitation.

Graphs Edge(arc) Vertices can be even or odd or undirected (two-way) Edges can be directed (one-way) This graph is connected. Degree(order) = 3 Odd vertex.

Graph Theory. A branch of math in which graphs are used to solve a problem. It is unlike a Cartesian graph that we used throughout our younger years of.

Graphs. Graphs Similar to the graphs you’ve known since the 5 th grade: line graphs, bar graphs, etc., but more general. Those mathematical graphs are.

MAT 2720 Discrete Mathematics Section 8.2 Paths and Cycles

Chapter 6: Graphs 6.1 Euler Circuits

Discrete Structures CISC 2315 FALL 2010 Graphs & Trees.

Graphs Upon completion you will be able to:

Graph Theory. undirected graph node: a, b, c, d, e, f edge: (a, b), (a, c), (b, c), (b, e), (c, d), (c, f), (d, e), (d, f), (e, f) subgraph.

Chapter 9: Graphs.

Graphs Definition: a graph is an abstract representation of a set of objects where some pairs of the objects are connected by links. The interconnected.

Hamilton Paths and Circuits 1 Click to Start 2 3 Start End.

Graph Theory Def: A graph is a set of vertices and edges G={V,E} Ex. V = {a,b,c,d,e} E = {ab,bd,ad,ed,ce,cd} Note: above is a purely mathematical definition.

Spanning Trees Dijkstra (Unit 10) SOL: DM.2 Classwork worksheet Homework (day 70) Worksheet Quiz next block.

1 GRAPH Learning Outcomes Students should be able to: Explain basic terminology of a graph Identify Euler and Hamiltonian cycle Represent graphs using.

Programming Abstractions Cynthia Lee CS106B. Upcoming Topics Graphs! 1.Basics  What are they? How do we represent them? 2.Theorems  What are some things.

Shortest Path Problems

Graphs Representation, BFS, DFS

Basic Concepts Graphs For more notes and topics visit:

Nuffield Free-Standing Mathematics Activity

Minimum Spanning Tree Chapter 13.6.

Discrete Maths 9. Graphs Objective

Spanning Trees Discrete Mathematics.

Graph Algorithm.

Can you draw this picture without lifting up your pen/pencil?

Graphs Representation, BFS, DFS

Graph Algorithm.

Introduction to Graph Theory Euler and Hamilton Paths and Circuits

Nuffield Free-Standing Mathematics Activity

Graphs Chapter 11 Objectives Upon completion you will be able to:

Graph Operations And Representation

Louisiana Travels.

Walks, Paths, and Circuits

Graph Theory By Amy C. and John M..

Decision Maths Graphs.

Route Inspection Which of these can be drawn without taking your pencil off the paper and without going over the same line twice? If we introduce a vertex.

Hamiltonian Circuits and Paths Vocabulary

Graphs G = (V, E) V are the vertices; E are the edges.

GRAPHS G=<V,E> Adjacent vertices Undirected graph

12 Further mathematics Adjacency Matrices.

Warm Up – 3/19 - Wednesday Give the vertex set. Give the edge set.

Graph Algorithm.

Graphs G = (V,E) V is the vertex set.

Presentation transcript:

© Nuffield Foundation 2012 Nuffield Free-Standing Mathematics Activity Networks © Rudolf Stricker

Networks This diagram shows a network. Problems involving the study of networks include optimisation tasks such as finding the shortest route and minimum cost. This activity introduces some of the terms and methods used.

vertex (node) edge Vertices can be even or odd or undirected (two-way) Edges can be directed (one-way) This is an example of a graph. This graph is connected Think about … Why must the sum of the degrees of the vertices in any graph always be even? What can you say about the number of odd vertices in a graph? The degree of a vertex is the number of edges that meet there

49 mins 39 mins 28 mins 22 mins 24 mins 29 mins 34 mins 15 miles 17 miles 15 miles 12 miles 17 miles 21 miles 20 miles Networks Colchester Stowmarket Ipswich Sudbury Bury St Edmunds Harwich A network is a weighted graph. The weights could be distances, times or costs.

Paths Paths are routes that do not visit any vertex more than once and do not go along any edge more than once. A cycle forms a loop by returning to its starting point.

Colchester Stowmarket Ipswich Sudbury Bury St Edmunds Harwich Adjacency matrix B Su C H I St B Su C H I St

Colchester Stowmarket Ipswich Sudbury Bury St Edmunds Harwich Distance matrix B Su C H I St B Su C H I St 15 miles 17 miles 15 miles 12 miles 17 miles 21 miles 20 miles Think about… What do you notice about the pattern in these matrices?

Reflect on your work Explain what is meant by the following terms: network, graph, edge, vertex, node, degree, directed, undirected, weighted, path, cycle, connected, adjacency matrix, distance matrix. © Nuffield Foundation 2012 If a road is one way, then when planning a driving route it may be possible to get from A to B, but not from B to A. What difference would this make to the adjacency matrix?