15. Directed graphs and networks

Slides:



Advertisements
Similar presentations
2.3 Modeling Real World Data with Matrices
Advertisements

Graph Theory Arnold Mesa. Basic Concepts n A graph G = (V,E) is defined by a set of vertices and edges v3 v1 v2Vertex (v1) Edge (e1) A Graph with 3 vertices.
8.3 Representing Relations Connection Matrices Let R be a relation from A = {a 1, a 2,..., a m } to B = {b 1, b 2,..., b n }. Definition: A n m  n connection.
Introduction to Graph “theory”
Module 5 – Networks and Decision Mathematics Chapter 24 – Directed Graphs.
CS 206 Introduction to Computer Science II 03 / 27 / 2009 Instructor: Michael Eckmann.
Prim’s Algorithm from a matrix A cable TV company is installing a system of cables to connect all the towns in the region. The numbers in the network are.
 Graph Graph  Types of Graphs Types of Graphs  Data Structures to Store Graphs Data Structures to Store Graphs  Graph Definitions Graph Definitions.
Graph theory at work.  Examine the procedure utilized by snow plows in Iowa City  Systemize and minimize routes  Review mathematical concepts involved.
CS 206 Introduction to Computer Science II 11 / 11 / Veterans Day Instructor: Michael Eckmann.
Maths for Computer Graphics
CS447/ECE453/SE465 Prof. Alencar University of Waterloo 1 CS447/ECE453/SE465 Software Testing Tutorial Winter 2008 Based on the tutorials by Prof. Kontogiannis,
Introduction to Graphs
MATH 310, FALL 2003 (Combinatorial Problem Solving) Lecture 3, Friday, September 5.
Graphs G = (V,E) V is the vertex set. Vertices are also called nodes and points. E is the edge set. Each edge connects two different vertices. Edges are.
CSC 2300 Data Structures & Algorithms March 30, 2007 Chapter 9. Graph Algorithms.
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,
5.1  Routing Problems: planning and design of delivery routes.  Euler Circuit Problems: Type of routing problem also known as transversability problem.
 What is a graph? What is a graph?  Directed vs. undirected graphs Directed vs. undirected graphs  Trees vs graphs Trees vs graphs  Terminology: Degree.
Nyhoff, ADTs, Data Structures and Problem Solving with C++, Second Edition, © 2005 Pearson Education, Inc. All rights reserved Graphs.
13.1 Matrices and Their Sums
Class Opener:. Identifying Matrices Student Check:
Chapter 1 Fundamental Concepts Introduction to Graph Theory Douglas B. West July 11, 2002.
Programming Practicum Day 3: Problem Solving with Graphs Aaron Tan NUS School of Computing.
Math – Graphs of Functions 1. Graph of a function: the graph of all the function’s ordered pairs 2.
How to Multiply Two Matrices. Steps for Matrix Multiplication 1.Determine whether the matrices are compatible. 2.Determine the dimensions of the product.
8.2 Operations With Matrices
4. Relations and Digraphs Binary Relation Geometric and Algebraic Representation Method Properties Equivalence Relations Operations.
1 Directed Graphs Chapter 8. 2 Objectives You will be able to: Say what a directed graph is. Describe two ways to represent a directed graph: Adjacency.
Data Structures & Algorithms Graphs Richard Newman based on book by R. Sedgewick and slides by S. Sahni.
Graphs G = (V,E) V is the vertex set. Vertices are also called nodes and points. E is the edge set. Each edge connects two different vertices. Edges are.
CSC2100B Tutorial 10 Graph Jianye Hao.
CSCI2100 Data Structures Tutorial 12
Graphs Basic properties.
A directed graph G consists of a set V of vertices and a set E of arcs where each arc in E is associated with an ordered pair of vertices from V. V={0,
Notes Over 4.2 Finding the Product of Two Matrices Find the product. If it is not defined, state the reason. To multiply matrices, the number of columns.
Math 10 N & M Unit Lesson (2) Digraphs and Matrices.
From digital to craft: How to make a data matrix with SNS data There are many applications that allow its users to visualize different networks directly.
Subject Four Graphs Data Structures. What is a graph? A data structure that consists of a set of nodes (vertices) and a set of edges that relate the nodes.
BCA-II Data Structure Using C Submitted By: Veenu Saini
13.4 Product of Two Matrices
12-1 Organizing Data Using Matrices
Graphs Representation, BFS, DFS
Matrix Representation of Graphs
Graph Representations
Basic Concepts Graphs For more notes and topics visit:
Warm-Up - 8/30/2010 Simplify. 1.) 2.) 3.) 4.) 5.)
Matrix Multiplication
Multiplication of Matrices
Matrix Representation of Graph
CS200: Algorithm Analysis
Graphs Representation, BFS, DFS
Graphs All tree structures are hierarchical. This means that each node can only have one parent node. Trees can be used to store data which has a definite.
Chapter 9: Graphs Basic Concepts
What is a Graph? a b c d e V= {a,b,c,d,e} E= {(a,b),(a,c),(a,d),
Walks, Paths, and Circuits
MATRICES MATRIX OPERATIONS.
2.2 Introduction to Matrices
CSCI2100 Data Structures Tutorial
Graphs G = (V, E) V are the vertices; E are the edges.
GRAPHS G=<V,E> Adjacent vertices Undirected graph
Multiplication of Matrices
3.6 Multiply Matrices.
12 Further mathematics Adjacency Matrices.
Matrix A matrix is a rectangular arrangement of numbers in rows and columns Each number in a matrix is called an Element. The dimensions of a matrix are.
Graph Vocabulary.
Chapter 9: Graphs Basic Concepts
Graphs G = (V,E) V is the vertex set.
Matrix Multiplication Sec. 4.2
Heaps Chapter 6 Section 6.9.
Presentation transcript:

15. Directed graphs and networks 15A Reachability and dominance in directed networks

A directed graph is a graph or network where every edge has a direction.

Reachability Reachability is the concept of how it is possible to go from one vertex in a directed network to another. Example, Ex 15A, Q.1 A one-stage pathway is one that includes one edge only. A two-stage pathway is one that includes two edges only. The indegree is the number of edges moving into a vertex and the outdegree is the number of edges moving away from a vertex.

Matrix representation Example, Ex 15A, Q.2 You can represent the number of one-stage pathways with a matrix. This matrix is labelled A, and is called the adjacency matrix, or the one-stage matrix. A matrix of two-stage pathways is labelled A2. In Further Maths, we only use matrices up to two-stage pathways. The sum of each row is equal to the outdegree of each vertex. The sum of each column is equal to the indegree of each vertex.

Dominance If there are more ways to go from A to B than there are to go from B to A, we say that A is dominant over B. Similarly, if B has edges moving to C and D, then B is dominant over C and D. The vertices in order of dominance would be A then B then C and then D.

Sometimes, it is not obvious which is the dominant vertex. If we add the matrix A (the one-stage matrix) to the matrix A2 (the two-stage matrix) we can work out the order of dominance by summing the rows of the resultant matrix. The row with the highest sum is the dominant matrix. Example, Ex 15A, Q. 6

Questions Ex 15A, Q. 3, 4, 5, 7, 8, 10