 Consider the cities Atlanta, Boston, Chicago, Detroit, Fargo, and Los Angeles.  We want to see what connections there are between cities on a particular.

Slides:

Advertisements

Similar presentations

Review Binary Search Trees Operations on Binary Search Tree

Advertisements

1 Slides based on those of Kenneth H. Rosen Slides by Sylvia Sorkin, Community College of Baltimore County - Essex Campus Graphs.

Discrete Mathematics and Its Applications

Graphs Graphs are the most general data structures we will study in this course. A graph is a more general version of connected nodes than the tree. Both.

Midwestern State University Department of Computer Science Dr. Ranette Halverson CMPS 2433 CHAPTER 4 - PART 2 GRAPHS 1.

Minimal Spanning Trees – Page 1CSCI 1900 – Discrete Structures CSCI 1900 Discrete Structures Minimal Spanning Trees Reading: Kolman, Section 7.5.

1 Representing Graphs. 2 Adjacency Matrix Suppose we have a graph G with n nodes. The adjacency matrix is the n x n matrix A=[a ij ] with: a ij = 1 if.

Graphs CS-240/341. Uses for Graphs computer networks and routing airline flights geographic maps course prerequisite structures tasks for completing a.

B.Ramamurthy1 Graphs Chapter 12 B.Ramamurthy. 2 Introduction A structure that represents connectivity information. A tree is kind of graph. Applications.

Introduction to Graphs What is a Graph? Some Example applications of Graphs. Graph Terminologies. Representation of Graphs. –Adjacency Matrix. –Adjacency.

CS 206 Introduction to Computer Science II 11 / 03 / 2008 Instructor: Michael Eckmann.

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

Blobs and Graphs Prof. Noah Snavely CS1114

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.

Graph Operations And Representation. Sample Graph Problems Path problems. Connectedness problems. Spanning tree problems.

Graphs Rosen 8.1, 8.2. There Are Many Uses for Graphs! Networks Data organizations Scene graphs Geometric simplification Program structure and processes.

Graphs, relations and matrices

Graphs CS /02/05 Graphs Slide 2 Copyright 2005, by the authors of these slides, and Ateneo de Manila University. All rights reserved Definition.

Graphs Chapter 10.

7 Graph 7.1 Even and Odd Degrees.

Graphs context: functions context: graphs and networks.

Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.

Algorithms and Running Time Algorithm: Well defined and finite sequence of steps to solve a well defined problem. Eg.,, Sequence of steps to multiply two.

 What is a graph? What is a graph?  Directed vs. undirected graphs Directed vs. undirected graphs  Trees vs graphs Trees vs graphs  Terminology: Degree.

9.1 Introduction to Graphs

Week 11 - Monday.  What did we talk about last time?  Binomial theorem and Pascal's triangle  Conditional probability  Bayes’ theorem.

9 Graphs. A graph G = (V, E) consists of V, a nonempty set of vertices (or nodes) and E, a set of edges. Each edge has either one or two vertices associated.

COSC 2007 Data Structures II Chapter 14 Graphs I.

Math III Warm Up9/4/13. What is the multiplicative identity of a 3x3 matrix? The additive identity?

Introduction to Graph Theory

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.

CSCI 115 Chapter 8 Topics in Graph Theory. CSCI 115 §8.1 Graphs.

CSE 373: Data Structures and Algorithms

Graphs A graphs is an abstract representation of a set of objects, called vertices or nodes, where some pairs of the objects are connected by links, called.

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.

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

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.

MAT 2720 Discrete Mathematics Section 8.2 Paths and Cycles

Chapter 6: Graphs 6.1 Euler Circuits

Basic properties Continuation

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.

Graphs Basic properties.

Vertex Edge Graphs. What is a vertex-edge graph?  A collection of points, some of which are joined by line segments or curves  Examples:

Chapter 9: Graphs.

Graph problems Prof. Ramin Zabih

Graphs. Graph Definitions A graph G is denoted by G = (V, E) where  V is the set of vertices or nodes of the graph  E is the set of edges or arcs connecting.

Week 11 - Friday.  What did we talk about last time?  Paths and circuits  Matrix representation of graphs.

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

© Copyright 2012 by Pearson Education, Inc. All Rights Reserved. 1 Chapter 22 Graphs and Applications.

Types of Angle Pairs Foldable

Introduction to Graphs

Angle Relationships Lesson 1.5.

Taibah University College of Computer Science & Engineering Course Title: Discrete Mathematics Code: CS 103 Chapter 10 Graphs Slides are adopted from “Discrete.

Introduction to Graphs

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

CS100: Discrete structures

CSE 373: Data Structures and Algorithms

Graph Operations And Representation

Walks, Paths, and Circuits

CSE 373 Data Structures and Algorithms

Graphs By Rajanikanth B.

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

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

Graph Vocabulary.

Graphs: Definitions How would you represent the following?

Chapter 14 Graphs © 2011 Pearson Addison-Wesley. All rights reserved.

Introduction to Graphs

Introduction to Graphs

Presentation transcript:

 Consider the cities Atlanta, Boston, Chicago, Detroit, Fargo, and Los Angeles.  We want to see what connections there are between cities on a particular Tuesday.

 United: Atlanta-Boston, Atlanta- Chicago, Boston-LA, Chicago-LA  American: Atlanta-Detroit, Atlanta- LA, Chicago-LA, Detroit-LA  Southwest: Atlanta-Chicago, Boston- Chicago, Chicago-Detroit, Chicago-LA  Ignoring the airline and direction of the flights, draw a picture that represents the situation.

  A graph is a set of points (called vertices, or nodes) and a set of lines called edges connecting some pairs of vertices.   Two vertices connected by an edge are said to be adjacent.   Vertices may be connected by more than one edge; A vertex need not be connected to any other vertex; A vertex may be connected to itself.   The degree of a vertex is the number of edges adjacent to it, i.e. the number of connections in which it is involved.

In Groups  For any graph, what can you say about the sum of the degrees of all the vertices?  Discuss.

You can’t get there from here   Even if there isn’t a direct route, we would like to know if it is possible to get from one place to the next.   Can we get from Boston to Detroit today?   Can we get from Chicago to Fargo today?   While these questions are relatively easy to answer for a small graph, as the number of vertices and edges grows, it becomes harder to keep track of all the different ways the vertices are connected.

The MATRIX  A matrix is a rectangular array of items—in our case, numbers.  Matrix operations

  Matrix notation and computation can help to answer the graph questions.   The adjacency matrix for a graph with n vertices is an n x n matrix whose (i, j) entry is 1 if the i th vertex and j th vertex are connected, and 0 if they are not.   Write the adjacency matrix for the Tuesday flight example.