Foundations of Discrete Mathematics
|
|
|
- Carol Bradley
- 6 years ago
- Views:
Transcription
1 Foundations of Discrete Mathematics Chapter 12 By Dr. Dalia M. Gil, Ph.D.
2 Trees Tree are useful in computer science, where they are employed in a wide range of algorithms. They are used to construct efficient algorithms for locating items in a list.
3 Trees Trees can be used to construct efficient code saving cost in data transmission and storage. Trees can be used to study games such as checkers and chess an can help determine winning strategies for playing these games.
4 Trees Trees can be used to model procedures carried out using a sequence of decisions. Constructing these models can help determine the computational complexity of algorithms based on a sequence of decisions, such a sorting algorithms.
5 Trees Procedures for building trees including Depth-first search, Breadth-first search, can be used to systematically explore the vertices of a graph.
6 Trees A tree is a connected undirected graph with no simple circuits. A tree cannot have a simple circuit, so a tree cannot contain multiple edges or loops. Any tree must be a simple graph.
7 An Example of a Tree The Bernoulli Family of Mathematicians Discrete Mathematics and its Applications. Fifth Edition, by Kenneth H. Rosen. Mc Graw Hill, pag 632
8 Example: Trees G 1 and G 2 are trees. Both are connected graph with no simple circuits. Discrete Mathematics and its Applications. Fifth Edition, by Kenneth H. Rosen. Mc Graw Hill, pag 632
9 Example: Not Trees G 3 is not a tree. e, b, a, d, e is a simple circuit. G 4 is not a tree. It is not connected. Discrete Mathematics and its Applications. Fifth Edition, by Kenneth H. Rosen. Mc Graw Hill, pag 632
10 Forest A Forest is a graph containing no simple circuits that are not necessarily connected. Forests have the property that each of their connected components is a tree.
11 Example: Forest A one graph with three connected components Discrete Mathematics and its Applications. Fifth Edition, by Kenneth H. Rosen. Mc Graw Hill, pag 633
12 Theorem An undirected graph is a tree if and only if there is a unique simple path between any two vertices.
13 A Rooted Tree A rooted tree is a tree in which one vertex has been designated as the root and every edge is directed away from the root. Discrete Mathematics and its Applications. Fifth Edition, by Kenneth H. Rosen. Mc Graw Hill, pag 634
14 Rooted Trees We can change an unrooted tree into a rooted tree by choosing any vertex as the root. Different choices of the root produce different trees. Discrete Mathematics and its Applications. Fifth Edition, by Kenneth H. Rosen. Mc Graw Hill, pag 578
15 Example: Rooted Trees The rooted trees formed by designating a to be the root and c to be the root, respectively, in the tree T. Discrete Mathematics and its Applications. Fifth Edition, by Kenneth H. Rosen. Mc Graw Hill, pag 634
16 The Terminology for Trees Suppose that T is a rooted tree. If v is a vertex in T other than the root. The parent of v is the unique vertex u such that there is a directed edge from u to v.
17 The Terminology for Trees When u is the parent of v, v is called a child of u. Vertices with the same parent are called siblings.
18 The Terminology for Trees The ancestors of a vertex other than the root are the vertices in the path from the root to this vertex, excluding the vertex itself and including the root. The descendants of a vertex v are those that have v as an ancestor.
19 The Terminology for Trees A vertex of a tree is called a leaf if it has no children. Vertices that have children are called internal vertices. The root is an internal vertex unless it is the only vertex in the graph, in which case it is a leaf.
20 The Terminology for Trees If a is a vertex in a tree, the subtree with a as its root is the subgraph of the tree consisting of a and its descendants and all edges incident to these descendant. Discrete Mathematics and its Applications. Fifth Edition, by Kenneth H. Rosen. Mc Graw Hill, pag 582
21 Example: Using Terminology T is a rooted tree with root a. The parent of vertex c is b. The children of g are h, i, and j. Discrete Mathematics and its Applications. Fifth Edition, by Kenneth H. Rosen. Mc Graw Hill, pag 635
22 Example: Using Terminology The siblings of h are i and j. The ancestors of e are c, b, and a. The descendant of b are c, d, and e. Discrete Mathematics and its Applications. Fifth Edition, by Kenneth H. Rosen. Mc Graw Hill, pag 635
23 Example: Using Terminology The internal vertices are a, b, c, g, h, and j. The leaves are d, e, f, i, k, l, and m. Discrete Mathematics and its Applications. Fifth Edition, by Kenneth H. Rosen. Mc Graw Hill, pag 635
24 Example: Using Terminology The subtree rooted at g is Discrete Mathematics and its Applications. Fifth Edition, by Kenneth H. Rosen. Mc Graw Hill, pag 635
25 m-ary Tree A rooted tree is called m-ary tree if every internal vertex has no more than m children. The tree is called a full m-ary tree if every internal vertex has exactly m children. An m-ary tree with m=2 is called a binary tree.
26 Example of m-ary tree T 1 is a full binary tree. Each of its internal vertices has two children Discrete Mathematics and its Applications. Fifth Edition, by Kenneth H. Rosen. Mc Graw Hill, pag 635
27 Example of m-ary tree T 2 is a full 3-ary tree. Each of its internal vertices has three children Discrete Mathematics and its Applications. Fifth Edition, by Kenneth H. Rosen. Mc Graw Hill, pag 635
28 Example of m-ary tree T 3 is a full 5-ary tree. Each of its internal vertices has five children Discrete Mathematics and its Applications. Fifth Edition, by Kenneth H. Rosen. Mc Graw Hill, pag 635
29 Example of m-ary tree T 4 is not a full m-ary tree for any m. Some of its internal vertices has 2 children and others have 3. Discrete Mathematics and its Applications. Fifth Edition, by Kenneth H. Rosen. Mc Graw Hill, pag 635
30 Ordered Rooted Tree An ordered rooted tree is rooted tree where the children of each internal vertex are ordered. Ordered rooted trees are drawn so that the children of each internal vertex are shown in order from left to right.
31 Ordered Binary Tree In ordered binary tree (a binary tree), if an internal vertex has two children. The first child is called the left child and the second child is called the right child.
32 Ordered Binary Tree The tree rooted at the left child of a vertex is called the left subtree of this vertex, and the tree rooted at the right child of a vertex is called the right subtree of the vertex.
33 Example The left child of d is f and the right child is g. The left and right subtrees of c are Discrete Mathematics and its Applications. Fifth Edition, by Kenneth H. Rosen. Mc Graw Hill, pag 636
34 Properties of Trees A tree with n vertices has n 1 edges. A full m-ary tree with i internal vertices contains n = m*i + 1 vertices. There are at most m h leaves in an m-ary tree of hight h. Where n: vertices, l: leaves, i: internal vertices.
35 Properties of Trees A full m-ary tree with 1. n vertices has i=(n 1)/m internal vertices and l = [(m 1) n + 1]/m leaves. 2. i internal vertices has n = m*i + 1 vertices and l = (m 1)i + 1 leaves. 3. l leaves has n = (m*l 1)/(m 1) vertices and i = (l 1)/(m 1) internal vertices.
36 Properties of Trees A rooted m-ary tree of height is balanced if all leaves are at levels h or h 1. T 1 is balanced. All its leaves are at levels 3 and 4. Discrete Mathematics and its Applications. Fifth Edition, by Kenneth H. Rosen. Mc Graw Hill, pag 640
37 Properties of Trees T 2 is not balanced. It has leaves at levels 2, 3, and 4. Discrete Mathematics and its Applications. Fifth Edition, by Kenneth H. Rosen. Mc Graw Hill, pag 640
38 Properties of Trees T 3 is balanced. All its leaves are at level 3. Discrete Mathematics and its Applications. Fifth Edition, by Kenneth H. Rosen. Mc Graw Hill, pag 640
39 Example: Properties of Trees The root a is at level 0. Vertices b, j, and k are at level 1. Vertices c, e, f, and l are at level 2. Discrete Mathematics and its Applications. Fifth Edition, by Kenneth H. Rosen. Mc Graw Hill, pag 640
40 Example: Properties of Trees Vertices g, g, i, m, and n are at level 3. Vertex h is at level 4. This tree has height 4. Discrete Mathematics and its Applications. Fifth Edition, by Kenneth H. Rosen. Mc Graw Hill, pag 640
41 Spanning Trees A spanning tree of a connected graph G is a subgraph that is a tree and that includes every vertex of G. A minimum spanning tree in a connected weighted graph is a spanning tree that has the smallest possible sum of weights of its edges.
42 Prim s Algorithm Prim s algorithm constructs a minimum spanning tree. Successively add to the tree edges of minimum weight that are incident to a vertex already in the tree and not forming a simple circuit with those edges already in the tree. Stop when n 1 edges have been adding.
43 Prim s Algorithm Step 1: Choose any vertex v and let e1 be and edge of least weight incident with v. Set k = 1. Step 2: While k < n If there exists a vertex that is not in the subgraph T whose edges are e 1, e 2,, e k, Let ek+1 be an edge of least weight among all edges of the form ux, where u is a vertex of T and x is a vertex not in T;
44 Prim s Algorithm (cont.) Let ek+1 be an edge of least weight among all edges of the form ux, where u is a vertex of T and x is a vertex not in T; Replace k by k + 1; else output e 1, e2,, e k and stop. end while.
45 Example Using Prim s Algorithm Use Prim s algorithm to design a minimum-cost communication network connecting all the computers represented by the following graph Discrete Mathematics and its Applications. Fifth Edition, by Kenneth H. Rosen. Mc Graw Hill, pag 689
46 Example Using Prim s Algorithm Choosing and initial edge of minimum weight. Successively adding edges of minimum weight that are incident to a vertex in a tree and do not form a simple circuit.
47 Example Using Prim s Algorithm Choice Edge Cost 1 {Chicago, Atlanta} $700 2 {Atlanta, New York} $800 3 {Chicago, San Francisco} $ San Francisco, Denver} $900 Total: $3600 Discrete Mathematics and its Applications. Fifth Edition, by Kenneth H. Rosen. Mc Graw Hill, pag 691
48 Example Using Prim s Algorithm Choice Edge Cost 1 {Chicago, Atlanta} $700 2 {Atlanta, New York} $800 3 {Chicago, San Francisco} $ San Francisco, Denver} $900 Total: $3600 Discrete Mathematics and its Applications. Fifth Edition, by Kenneth H. Rosen. Mc Graw Hill, pag 691
49 Example Using Prim s Algorithm Use Prim s algorithm to find a minimum spanning tree in the following graph. Discrete Mathematics and its Applications. Fifth Edition, by Kenneth H. Rosen. Mc Graw Hill, pag 691
50 Example Using Prim s Algorithm Use Prim s algorithm to find a minimum spanning tree in the following graph. Discrete Mathematics and its Applications. Fifth Edition, by Kenneth H. Rosen. Mc Graw Hill, pag 691
51 Example Using Prim s Algorithm Use Prim s algorithm to find a minimum spanning tree in the following graph. Discrete Mathematics and its Applications. Fifth Edition, by Kenneth H. Rosen. Mc Graw Hill, pag 691
52 Kruskal s Algorithm This algorithm finds a minimum spanning tree in a connected weighted graph with n > 1 vertices.
53 Kruskal s Algorithm Step 1: Find an edge of least weight and call this e 1. Set k = 1. Step 2: While k < n if there exits an edge e such that {e} {e 1,. e 2,, e k } does not contain a circuit * let e k+1 be such an edge of least weight; replace k by k + 1; else output e 1, e 2,, e k and stop end while
54 Example Using Kruskal Algorithm Use Kruskal s algorithm to find a minimum spanning tree in the following weighted graph. Discrete Mathematics and its Applications. Fifth Edition, by Kenneth H. Rosen. Mc Graw Hill, pag 691
55 Example Using Kruskal Algorithm Use Kruskal s algorithm to find a minimum spanning tree in the following weighted graph. Discrete Mathematics and its Applications. Fifth Edition, by Kenneth H. Rosen. Mc Graw Hill, pag 692
56 Digraphs A digraph is a pair (V, E) of sets, V nonempty and each element of E an ordered pair of distinct elements of V. The elements of V are called vertices and the elements of E are called arcs.
57 Digraphs The same terms can be used for graphs and digraphs. The exception: In a digraph we use term arc instead of edge. An arc is an ordered pair (u, v) or (v, u). An edge is an unordered pair of vertices {u, v}.
58 Digraphs The vertices of a graph have degrees, a vertex of a digraph has an indegree and outdigree. Indegree is the number of arcs directed into a vertex. Outdegree is the number of arcs directed away from the vertex.
59 Examples: Digraphs G 1 has outdegree 1. G 2 has outdegree 2. G 1 and G 2 are not isomorphic because of the previous reasons. Discrete Mathematics with Graph Theory. Fifth Edition, by E. G. Goodaire ane M. Parmenter Prentce Hall, pag 344
60 Examples: Digraphs G 1 is Eulerian because uvwu is an Eulerian circuit and a Hamiltonian cycle. G 2 has neither an Eulerian nor a Hamiltonian cycle, but it has a Hamiltonian path uvw. Discrete Mathematics with Graph Theory. Fifth Edition, by E. G. Goodaire ane M. Parmenter Prentce Hall, pag 344
61 Examples: Digraphs G 3 has vertices u and x with indegree 2 and outdegree 1. Vertex v has indegree 0 and outdegree 2 and vertex w has indegree 1 and outdegree 1. Discrete Mathematics with Graph Theory. Fifth Edition, by E. G. Goodaire ane M. Parmenter Prentce Hall, pag 344
62 Examples: Digraphs The indegree sequence is 2, 2, 1, 0, and the outdegree sequence is 2, 1, 1, 1. The sum of the indegrees of the vertices equals the sum of the outdegrees of the vertices is the number of arcs. Discrete Mathematics with Graph Theory. Fifth Edition, by E. G. Goodaire ane M. Parmenter Prentce Hall, pag 344
63 Examples: Digraphs G 3 is not Hamiltonian because vertex v has indegree 0. There is no way of reaching v on a walk respecting orientation edges, no Hamiltonian cycle can exist. Discrete Mathematics with Graph Theory. Fifth Edition, by E. G. Goodaire ane M. Parmenter Prentce Hall, pag 344
64 Examples: Digraphs G 4 is not Hamiltonian because vertex x has outdegree 0, so no walk respecting orientations can leave x. Discrete Mathematics with Graph Theory. Fifth Edition, by E. G. Goodaire ane M. Parmenter Prentce Hall, pag 344
65 Digraphs A digraph is called strongly connected if and only if there is a walk from any vertex to any other vertex that respects the orientation of each arc. A digraph is Eulerian if and only if it is strongly connected and, for every vertex, the indegree equals the outdegree.
66 Examples: Digraphs G 3 is not Eulerian. It is not strongly connected (there is no way to reach v). The indegrees and outdegrees of three vertices (u, v, and x) are not the same. Discrete Mathematics with Graph Theory. Fifth Edition, by E. G. Goodaire ane M. Parmenter Prentce Hall, pag 346
67 Examples: Digraphs This digraph is Eulerian. It is strongly connected (there is a circuit uvwu that permits travel in the direction of arrows between two vertices The indegree and outdegree of every vertex are 2.(an Euler circuit uwvuvwu). Discrete Mathematics with Graph Theory. Fifth Edition, by E. G. Goodaire ane M. Parmenter Prentce Hall, pag 346
68 Acyclic Digraphs A directed graph is a acyclic if it contains no directed cycles. This digraph is acyclic. There are no cycles. There is never an arc on which to return to the first vertex. Discrete Mathematics with Graph Theory. Fifth Edition, by E. G. Goodaire ane M. Parmenter Prentce Hall, pag 393
69 Acyclic Digraphs A directed graph is a acyclic if it contains no directed cycles. This digraph is not acyclic. There are cycles. Discrete Mathematics with Graph Theory. Fifth Edition, by E. G. Goodaire ane M. Parmenter Prentce Hall, pag 393
70 A Canonical Ordering A labeling v 0, v 1,, v n-1 of the vertices of a digraph is called canonical if the only arcs have the form v i v j with i < j. A canonical labeling of vertices is also called a canonical ordering. A digraph has a canonical ordering of vertices if and only if it is acyclic.
71 A Canonical Ordering A digraph has a canonical ordering of vertices if and only if it is acyclic. A digraph is acyclic if and only if it has a canonical labeling of vertices Discrete Mathematics with Graph Theory. Fifth Edition, by E. G. Goodaire ane M. Parmenter Prentce Hall, pag 393
72 Strongly connected Orientation To orient or to assign an orientation to an edge in a graph is to assign a direction to that edge. To orient or assign an orientation to a graph is to orient every edge in the graph. A graph has a strongly connected orientation if it is possible to orient it in such a way that the resulting digraph is strongly connected.
73 Depth-First Search Depth-first search is a simple and efficient procedure used as the for a number of important computer algorithms in graphs. We can build a spanning trees for a connected simple graph using a depthfirst search.
74 Depth-First Search Algorithm Let G be a graph with n vertices. Step 1. Choose any vertex and label it 1. Set k = 1. Step 2. While there are unlabeled vertices if there exists an unlabeld vertex adjacent to k, assign to it the smallest unused label l from the set {1, 2,, n} and set k = l else if k = 1 stop; else backtrack to the vertex l from which k was labeled and set k = l. Step 3. end while.
75 Example: Depth-First Search Use a depth-first search to find a spanning tree for the graph G. Discrete Mathematics and its Applications. Fifth Edition, by Kenneth H. Rosen. Mc Graw Hill, pag 678
76 Example: Depth-First Search Arbitrary start with vertex f. A path is built by successively adding edges incident with vertices not already in the path, as long as possible Discrete Mathematics and its Applications. Fifth Edition, by Kenneth H. Rosen. Mc Graw Hill, pag 678
77 Example: Depth-First Search From f create a path f, g, h, j (other path could have been built). Discrete Mathematics and its Applications. Fifth Edition, by Kenneth H. Rosen. Mc Graw Hill, pag 678
78 Example: Depth-First Search Next, backtrack to k. There is no path beginning at k containing vertices not already visited. So, backtrack to h. Form the path h, i. Discrete Mathematics and its Applications. Fifth Edition, by Kenneth H. Rosen. Mc Graw Hill, pag 678
79 Example: Depth-First Search Then, backtrack to h, and then to f. From f build the path f, d, e, c, a. Discrete Mathematics and its Applications. Fifth Edition, by Kenneth H. Rosen. Mc Graw Hill, pag 678
80 Example: Depth-First Search Then, backtrack to c, and form the path c, b. The result is the spanning graph. Discrete Mathematics and its Applications. Fifth Edition, by Kenneth H. Rosen. Mc Graw Hill, pag 678
81 Example: Depth-First Search Use a depth-first search to find a spanning tree for the graph G. Discrete Mathematics with Graph Theory. Fifth Edition, by E. G. Goodaire ane M. Parmenter Prentce Hall, pag 401
82 Topics covered Trees and their properties. Spanning trees and minimum spanning trees algorithms. Depth-First Search.
83 Reference Discrete Mathematics with Graph Theory, Third Edition, E. Goodaire and Michael Parmenter, Pearson Prentice Hall, pp
84 Reference Discrete Mathematics and Its Applications, Fifth Edition, Kenneth H. Rosen, McGraw- Hill, pp
Foundations of Discrete Mathematics
Foundations of Discrete Mathematics Chapters 9 By Dr. Dalia M. Gil, Ph.D. Graphs Graphs are discrete structures consisting of vertices and edges that connect these vertices. Graphs A graph is a pair (V,
Section Summary. Introduction to Trees Rooted Trees Trees as Models Properties of Trees
Chapter 11 Copyright McGraw-Hill Education. All rights reserved. No reproduction or distribution without the prior written consent of McGraw-Hill Education. Chapter Summary Introduction to Trees Applications
March 20/2003 Jayakanth Srinivasan,
Definition : A simple graph G = (V, E) consists of V, a nonempty set of vertices, and E, a set of unordered pairs of distinct elements of V called edges. Definition : In a multigraph G = (V, E) two or
Trees Algorhyme by Radia Perlman
Algorhyme by Radia Perlman I think that I shall never see A graph more lovely than a tree. A tree whose crucial property Is loop-free connectivity. A tree which must be sure to span. So packets can reach
Hamilton paths & circuits. Gray codes. Hamilton Circuits. Planar Graphs. Hamilton circuits. 10 Nov 2015
Hamilton paths & circuits Def. A path in a multigraph is a Hamilton path if it visits each vertex exactly once. Def. A circuit that is a Hamilton path is called a Hamilton circuit. Hamilton circuits Constructing
An undirected graph is a tree if and only of there is a unique simple path between any 2 of its vertices.
Trees Trees form the most widely used subclasses of graphs. In CS, we make extensive use of trees. Trees are useful in organizing and relating data in databases, file systems and other applications. Formal
Graph and Digraph Glossary
1 of 15 31.1.2004 14:45 Graph and Digraph Glossary A B C D E F G H I-J K L M N O P-Q R S T U V W-Z Acyclic Graph A graph is acyclic if it contains no cycles. Adjacency Matrix A 0-1 square matrix whose
Chapter Summary. Introduction to Trees Applications of Trees Tree Traversal Spanning Trees Minimum Spanning Trees
Trees Chapter 11 Chapter Summary Introduction to Trees Applications of Trees Tree Traversal Spanning Trees Minimum Spanning Trees Introduction to Trees Section 11.1 Section Summary Introduction to Trees
CS 441 Discrete Mathematics for CS Lecture 26. Graphs. CS 441 Discrete mathematics for CS. Final exam
CS 441 Discrete Mathematics for CS Lecture 26 Graphs Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square Final exam Saturday, April 26, 2014 at 10:00-11:50am The same classroom as lectures The exam
MAT 7003 : Mathematical Foundations. (for Software Engineering) J Paul Gibson, A207.
MAT 7003 : Mathematical Foundations (for Software Engineering) J Paul Gibson, A207 paul.gibson@it-sudparis.eu http://www-public.it-sudparis.eu/~gibson/teaching/mat7003/ Graphs and Trees http://www-public.it-sudparis.eu/~gibson/teaching/mat7003/l2-graphsandtrees.pdf
7.1 Introduction. A (free) tree T is A simple graph such that for every pair of vertices v and w there is a unique path from v to w
Chapter 7 Trees 7.1 Introduction A (free) tree T is A simple graph such that for every pair of vertices v and w there is a unique path from v to w Tree Terminology Parent Ancestor Child Descendant Siblings
Crossing bridges. Crossing bridges Great Ideas in Theoretical Computer Science. Lecture 12: Graphs I: The Basics. Königsberg (Prussia)
15-251 Great Ideas in Theoretical Computer Science Lecture 12: Graphs I: The Basics February 22nd, 2018 Crossing bridges Königsberg (Prussia) Now Kaliningrad (Russia) Is there a way to walk through the
Konigsberg Bridge Problem
Graphs Konigsberg Bridge Problem c C d g A Kneiphof e D a B b f c A C d e g D a b f B Euler s Graph Degree of a vertex: the number of edges incident to it Euler showed that there is a walk starting at
Graph Theory CS/Math231 Discrete Mathematics Spring2015
1 Graphs Definition 1 A directed graph (or digraph) G is a pair (V, E), where V is a finite set and E is a binary relation on V. The set V is called the vertex set of G, and its elements are called vertices
Chapter 9 Graph Algorithms
Introduction graph theory useful in practice represent many real-life problems can be if not careful with data structures Chapter 9 Graph s 2 Definitions Definitions an undirected graph is a finite set
UNIT IV -NON-LINEAR DATA STRUCTURES 4.1 Trees TREE: A tree is a finite set of one or more nodes such that there is a specially designated node called the Root, and zero or more non empty sub trees T1,
Chapter 9 Graph Algorithms
Chapter 9 Graph Algorithms 2 Introduction graph theory useful in practice represent many real-life problems can be if not careful with data structures 3 Definitions an undirected graph G = (V, E) is a
Chapter 10: Trees. A tree is a connected simple undirected graph with no simple circuits.
Chapter 10: Trees A tree is a connected simple undirected graph with no simple circuits. Properties: o There is a unique simple path between any 2 of its vertices. o No loops. o No multiple edges. Example
Introduction to Computers and Programming. Concept Question
Introduction to Computers and Programming Prof. I. K. Lundqvist Lecture 7 April 2 2004 Concept Question G1(V1,E1) A graph G(V, where E) is V1 a finite = {}, nonempty E1 = {} set of G2(V2,E2) vertices and
Elements of Graph Theory
Elements of Graph Theory Quick review of Chapters 9.1 9.5, 9.7 (studied in Mt1348/2008) = all basic concepts must be known New topics we will mostly skip shortest paths (Chapter 9.6), as that was covered
CS204 Discrete Mathematics. 11 Trees. 11 Trees
11.1 Introduction to Trees Def. 1 A tree T = (V, E) is a connected undirected graph with no simple circuits. acyclic connected graph. forest a set of trees. A vertex of degree one is called leaf. Thm.
CSC Intro to Intelligent Robotics, Spring Graphs
CSC 445 - Intro to Intelligent Robotics, Spring 2018 Graphs Graphs Definition: A graph G = (V, E) consists of a nonempty set V of vertices (or nodes) and a set E of edges. Each edge has either one or two
Graph Theory. Probabilistic Graphical Models. L. Enrique Sucar, INAOE. Definitions. Types of Graphs. Trajectories and Circuits.
Theory Probabilistic ical Models L. Enrique Sucar, INAOE and (INAOE) 1 / 32 Outline and 1 2 3 4 5 6 7 8 and 9 (INAOE) 2 / 32 A graph provides a compact way to represent binary relations between a set of
11/22/2016. Chapter 9 Graph Algorithms. Introduction. Definitions. Definitions. Definitions. Definitions
Introduction Chapter 9 Graph Algorithms graph theory useful in practice represent many real-life problems can be slow if not careful with data structures 2 Definitions an undirected graph G = (V, E) is
Chapter 9 Graph Algorithms
Chapter 9 Graph Algorithms 2 Introduction graph theory useful in practice represent many real-life problems can be slow if not careful with data structures 3 Definitions an undirected graph G = (V, E)
Outline. Introduction. Representations of Graphs Graph Traversals. Applications. Definitions and Basic Terminologies
Graph Chapter 9 Outline Introduction Definitions and Basic Terminologies Representations of Graphs Graph Traversals Breadth first traversal Depth first traversal Applications Single source shortest path
Chapter 11: Graphs and Trees. March 23, 2008
Chapter 11: Graphs and Trees March 23, 2008 Outline 1 11.1 Graphs: An Introduction 2 11.2 Paths and Circuits 3 11.3 Matrix Representations of Graphs 4 11.5 Trees Graphs: Basic Definitions Informally, a
Topics. Trees Vojislav Kecman. Which graphs are trees? Terminology. Terminology Trees as Models Some Tree Theorems Applications of Trees CMSC 302
Topics VCU, Department of Computer Science CMSC 302 Trees Vojislav Kecman Terminology Trees as Models Some Tree Theorems Applications of Trees Binary Search Tree Decision Tree Tree Traversal Spanning Trees
Graph Algorithms Using Depth First Search
Graph Algorithms Using Depth First Search Analysis of Algorithms Week 8, Lecture 1 Prepared by John Reif, Ph.D. Distinguished Professor of Computer Science Duke University Graph Algorithms Using Depth
v V Question: How many edges are there in a graph with 10 vertices each of degree 6?
ECS20 Handout Graphs and Trees March 4, 2015 (updated 3/9) Notion of a graph 1. A graph G = (V,E) consists of V, a nonempty set of vertices (or nodes) and E, a set of pairs of elements of V called edges.
GRAPHS, GRAPH MODELS, GRAPH TERMINOLOGY, AND SPECIAL TYPES OF GRAPHS
GRAPHS, GRAPH MODELS, GRAPH TERMINOLOGY, AND SPECIAL TYPES OF GRAPHS DR. ANDREW SCHWARTZ, PH.D. 10.1 Graphs and Graph Models (1) A graph G = (V, E) consists of V, a nonempty set of vertices (or nodes)
Directed Graph and Binary Trees
and Dr. Nahid Sultana December 19, 2012 and Degrees Paths and Directed graphs are graphs in which the edges are one-way. This type of graphs are frequently more useful in various dynamic systems such as
CSE 21 Mathematics for Algorithm and System Analysis
CSE 21 Mathematics for Algorithm and System Analysis Unit 4: Basic Concepts in Graph Theory Section 3: Trees 1 Review : Decision Tree (DT-Section 1) Root of the decision tree on the left: 1 Leaves of the
An Introduction to Graph Theory
An Introduction to Graph Theory CIS008-2 Logic and Foundations of Mathematics David Goodwin david.goodwin@perisic.com 12:00, Friday 17 th February 2012 Outline 1 Graphs 2 Paths and cycles 3 Graphs and
Undirected Graphs. Hwansoo Han
Undirected Graphs Hwansoo Han Definitions Undirected graph (simply graph) G = (V, E) V : set of vertexes (vertices, nodes, points) E : set of edges (lines) An edge is an unordered pair Edge (v, w) = (w,
BACKGROUND: A BRIEF INTRODUCTION TO GRAPH THEORY
BACKGROUND: A BRIEF INTRODUCTION TO GRAPH THEORY General definitions; Representations; Graph Traversals; Topological sort; Graphs definitions & representations Graph theory is a fundamental tool in sparse
12/5/17. trees. CS 220: Discrete Structures and their Applications. Trees Chapter 11 in zybooks. rooted trees. rooted trees
trees CS 220: Discrete Structures and their Applications A tree is an undirected graph that is connected and has no cycles. Trees Chapter 11 in zybooks rooted trees Rooted trees. Given a tree T, choose
Discrete mathematics
Discrete mathematics Petr Kovář petr.kovar@vsb.cz VŠB Technical University of Ostrava DiM 470-2301/02, Winter term 2018/2019 About this file This file is meant to be a guideline for the lecturer. Many
Lecture 5: Graphs & their Representation
Lecture 5: Graphs & their Representation Why Do We Need Graphs Graph Algorithms: Many problems can be formulated as problems on graphs and can be solved with graph algorithms. To learn those graph algorithms,
Trees. Arash Rafiey. 20 October, 2015
20 October, 2015 Definition Let G = (V, E) be a loop-free undirected graph. G is called a tree if G is connected and contains no cycle. Definition Let G = (V, E) be a loop-free undirected graph. G is called
Reference Sheet for CO142.2 Discrete Mathematics II
Reference Sheet for CO14. Discrete Mathematics II Spring 017 1 Graphs Defintions 1. Graph: set of N nodes and A arcs such that each a A is associated with an unordered pair of nodes.. Simple graph: no
Discrete mathematics II. - Graphs
Emil Vatai April 25, 2018 Basic definitions Definition of an undirected graph Definition (Undirected graph) An undirected graph or (just) a graph is a triplet G = (ϕ, E, V ), where V is the set of vertices,
Chapter 2 Graphs. 2.1 Definition of Graphs
Chapter 2 Graphs Abstract Graphs are discrete structures that consist of vertices and edges connecting some of these vertices. Graphs have many applications in Mathematics, Computer Science, Engineering,
Lecture 10. Elementary Graph Algorithm Minimum Spanning Trees
Lecture 10. Elementary Graph Algorithm Minimum Spanning Trees T. H. Cormen, C. E. Leiserson and R. L. Rivest Introduction to Algorithms, 3rd Edition, MIT Press, 2009 Sungkyunkwan University Hyunseung Choo
EECS 1028 M: Discrete Mathematics for Engineers
EECS 1028 M: Discrete Mathematics for Engineers Suprakash Datta Office: LAS 3043 Course page: http://www.eecs.yorku.ca/course/1028 Also on Moodle S. Datta (York Univ.) EECS 1028 W 18 1 / 15 Graphs: Motivations
Info 2950, Lecture 16
Info 2950, Lecture 16 28 Mar 2017 Prob Set 5: due Fri night 31 Mar Breadth first search (BFS) and Depth First Search (DFS) Must have an ordering on the vertices of the graph. In most examples here, the
1 Digraphs. Definition 1
1 Digraphs Definition 1 Adigraphordirected graphgisatriplecomprisedofavertex set V(G), edge set E(G), and a function assigning each edge an ordered pair of vertices (tail, head); these vertices together
Trees Rooted Trees Spanning trees and Shortest Paths. 12. Graphs and Trees 2. Aaron Tan November 2017
12. Graphs and Trees 2 Aaron Tan 6 10 November 2017 1 10.5 Trees 2 Definition Definition Definition: Tree A graph is said to be circuit-free if, and only if, it has no circuits. A graph is called a tree
Logic: The Big Picture. Axiomatizing Arithmetic. Tautologies and Valid Arguments. Graphs and Trees
Axiomatizing Arithmetic Logic: The Big Picture Suppose we restrict the domain to the natural numbers, and allow only the standard symbols of arithmetic (+,, =, >, 0, 1). Typical true formulas include:
Graphs and trees come up everywhere. We can view the internet as a graph (in many ways) Web search views web pages as a graph
Graphs and Trees Graphs and trees come up everywhere. We can view the internet as a graph (in many ways) who is connected to whom Web search views web pages as a graph Who points to whom Niche graphs (Ecology):
Graphs Definitions. Gunnar Gotshalks. GraphDefinitions 1
Graphs Definitions GraphDefinitions 1 Examples of Graphs Street maps» Vertices are the intersections» Edges are the streets Power line network» Vertices are the houses & power stations» Edges are the power
Graphs V={A,B,C,D,E} E={ (A,D),(A,E),(B,D), (B,E),(C,D),(C,E)}
Graphs and Trees 1 Graphs (simple) graph G = (V, ) consists of V, a nonempty set of vertices and, a set of unordered pairs of distinct vertices called edges. xamples V={,,,,} ={ (,),(,),(,), (,),(,),(,)}
Graphs and Network Flows ISE 411. Lecture 7. Dr. Ted Ralphs
Graphs and Network Flows ISE 411 Lecture 7 Dr. Ted Ralphs ISE 411 Lecture 7 1 References for Today s Lecture Required reading Chapter 20 References AMO Chapter 13 CLRS Chapter 23 ISE 411 Lecture 7 2 Minimum
Chapter 3 Trees. Theorem A graph T is a tree if, and only if, every two distinct vertices of T are joined by a unique path.
Chapter 3 Trees Section 3. Fundamental Properties of Trees Suppose your city is planning to construct a rapid rail system. They want to construct the most economical system possible that will meet the
Module 2: NETWORKS AND DECISION MATHEMATICS
Further Mathematics 2017 Module 2: NETWORKS AND DECISION MATHEMATICS Chapter 9 Undirected Graphs and Networks Key knowledge the conventions, terminology, properties and types of graphs; edge, face, loop,
Figure 4.1: The evolution of a rooted tree.
106 CHAPTER 4. INDUCTION, RECURSION AND RECURRENCES 4.6 Rooted Trees 4.6.1 The idea of a rooted tree We talked about how a tree diagram helps us visualize merge sort or other divide and conquer algorithms.
Definition of Graphs and Trees. Representation of Trees.
Definition of Graphs and Trees. Representation of Trees. Chapter 6 Definition of graphs (I) A directed graph or digraph is a pair G = (V,E) s.t.: V is a finite set called the set of vertices of G. E V
Further Mathematics 2016 Module 2: NETWORKS AND DECISION MATHEMATICS Chapter 9 Undirected Graphs and Networks
Further Mathematics 2016 Module 2: NETWORKS AND DECISION MATHEMATICS Chapter 9 Undirected Graphs and Networks Key knowledge the conventions, terminology, properties and types of graphs; edge, face, loop,
ROOT A node which doesn t have a parent. In the above tree. The Root is A. LEAF A node which doesn t have children is called leaf or Terminal node.
UNIT III : DYNAMIC STORAGE MANAGEMENT Trees: Binary tree, Terminology, Representation, Traversals, Applications. Graph: Terminology, Representation, Traversals Applications - spanning trees, shortest path.
Lecture 5: Graphs. Rajat Mittal. IIT Kanpur
Lecture : Graphs Rajat Mittal IIT Kanpur Combinatorial graphs provide a natural way to model connections between different objects. They are very useful in depicting communication networks, social networks
GRAPHICAL ALGORITHMS. UNIT _II Lecture-12 Slides No. 3-7 Lecture Slides No Lecture Slides No
GRAPHICAL ALGORITHMS UNIT _II Lecture-12 Slides No. 3-7 Lecture-13-16 Slides No. 8-26 Lecture-17-19 Slides No. 27-42 Topics Covered Graphs & Trees ( Some Basic Terminologies) Spanning Trees (BFS & DFS)
UNDIRECTED GRAPH: a set of vertices and a set of undirected edges each of which is associated with a set of one or two of these vertices.
Graphs 1 Graph: A graph G = (V, E) consists of a nonempty set of vertices (or nodes) V and a set of edges E. Each edge has either one or two vertices associated with it, called its endpoints. An edge is
Graph Theory. Part of Texas Counties.
Graph Theory Part of Texas Counties. We would like to visit each of the above counties, crossing each county only once, starting from Harris county. Is this possible? This problem can be modeled as a graph.
License. Discrete Mathematics. Tree. Topics. Definition tree: connected graph with no cycle. examples. c T. Uyar, A. Yayımlı, E.
License c 2001-2016 T. Uyar, A. Yayımlı, E. Harmancı Discrete Mathematics Trees H. Turgut Uyar Ayşegül Gençata Yayımlı Emre Harmancı 2001-2016 You are free to: Share copy and redistribute the material
7.3 Spanning trees Spanning trees [ ] 61
![7.3 Spanning trees Spanning trees [ ] 61](/thumbs/77/75523634.jpg "7.3 Spanning trees Spanning trees [ ] 61")
7.3. Spanning trees [161211-1348 ] 61 7.3 Spanning trees We know that trees are connected graphs with the minimal number of edges. Hence trees become very useful in applications where our goal is to connect
Graphs: basic concepts and algorithms
: basic concepts and algorithms Topics covered by this lecture: - Reminder Trees Trees (in-order,post-order,pre-order) s (BFS, DFS) Denitions: Reminder Directed graph (digraph): G = (V, E), V - vertex
Chapter 9. Priority Queue
Chapter 9 Priority Queues, Heaps, Graphs Spring 2015 1 Priority Queue Priority Queue An ADT in which only the item with the highest priority can be accessed 2Spring 2015 Priority Depends on the Application
Trees. Truong Tuan Anh CSE-HCMUT
Trees Truong Tuan Anh CSE-HCMUT Outline Basic concepts Trees Trees A tree consists of a finite set of elements, called nodes, and a finite set of directed lines, called branches, that connect the nodes
Chapter 4 Trees. Theorem A graph G has a spanning tree if and only if G is connected.
Chapter 4 Trees 4-1 Trees and Spanning Trees Trees, T: A simple, cycle-free, loop-free graph satisfies: If v and w are vertices in T, there is a unique simple path from v to w. Eg. Trees. Spanning trees:
THE EULER TOUR TECHNIQUE: EVALUATION OF TREE FUNCTIONS
PARALLEL AND DISTRIBUTED ALGORITHMS BY DEBDEEP MUKHOPADHYAY AND ABHISHEK SOMANI http://cse.iitkgp.ac.in/~debdeep/courses_iitkgp/palgo/index.htm THE EULER TOUR TECHNIQUE: EVALUATION OF TREE FUNCTIONS 2
Trees (Part 1, Theoretical) CSE 2320 Algorithms and Data Structures University of Texas at Arlington
Trees (Part 1, Theoretical) CSE 2320 Algorithms and Data Structures University of Texas at Arlington 1 Trees Trees are a natural data structure for representing specific data. Family trees. Organizational
4. (a) Draw the Petersen graph. (b) Use Kuratowski s teorem to prove that the Petersen graph is non-planar.
UPPSALA UNIVERSITET Matematiska institutionen Anders Johansson Graph Theory Frist, KandMa, IT 010 10 1 Problem sheet 4 Exam questions Solve a subset of, say, four questions to the problem session on friday.
Week 11: Eulerian and Hamiltonian graphs; Trees. 15 and 17 November, 2017
(1/22) MA284 : Discrete Mathematics Week 11: Eulerian and Hamiltonian graphs; Trees http://www.maths.nuigalway.ie/~niall/ma284/ 15 and 17 November, 2017 Hamilton s Icosian Game (Library or the Royal Irish
DS UNIT 4. Matoshri College of Engineering and Research Center Nasik Department of Computer Engineering Discrete Structutre UNIT - IV
Sr.No. Question Option A Option B Option C Option D 1 2 3 4 5 6 Class : S.E.Comp Which one of the following is the example of non linear data structure Let A be an adjacency matrix of a graph G. The ij
Graphs and Genetics. Outline. Computational Biology IST. Ana Teresa Freitas 2015/2016. Slides source: AED (MEEC/IST); Jones and Pevzner (book)
raphs and enetics Computational Biology IST Ana Teresa Freitas / Slides source: AED (MEEC/IST); Jones and Pevzner (book) Outline l Motivacion l Introduction to raph Theory l Eulerian & Hamiltonian Cycle
Trees. CSC 1300 Discrete Structures Villanova University
Trees CSC 1300 Discrete Structures Villanova University Major Themes Trees Spanning trees Binary trees Binary search trees ApplicaAons But first: Review Graphs Villanova CSC 1300 - Dr Papalaskari 2 Review
Definition Example Solution
Section 11.4 Spanning Trees Definition: Let G be a simple graph. A spanning tree of G is a subgraph of G that is a tree containing every vertex of G. Example: Find the spanning tree of this simple graph:
4 Basics of Trees. Petr Hliněný, FI MU Brno 1 FI: MA010: Trees and Forests
4 Basics of Trees Trees, actually acyclic connected simple graphs, are among the simplest graph classes. Despite their simplicity, they still have rich structure and many useful application, such as in
Trees : Part 1. Section 4.1. Theory and Terminology. A Tree? A Tree? Theory and Terminology. Theory and Terminology
Trees : Part Section. () (2) Preorder, Postorder and Levelorder Traversals Definition: A tree is a connected graph with no cycles Consequences: Between any two vertices, there is exactly one unique path
THE EULER TOUR TECHNIQUE: EVALUATION OF TREE FUNCTIONS
PARALLEL AND DISTRIBUTED ALGORITHMS BY DEBDEEP MUKHOPADHYAY AND ABHISHEK SOMANI http://cse.iitkgp.ac.in/~debdeep/courses_iitkgp/palgo/index.htm THE EULER TOUR TECHNIQUE: EVALUATION OF TREE FUNCTIONS 2
Uses for Trees About Trees Binary Trees. Trees. Seth Long. January 31, 2010
Uses for About Binary January 31, 2010 Uses for About Binary Uses for Uses for About Basic Idea Implementing Binary Example: Expression Binary Search Uses for Uses for About Binary Uses for Storage Binary
ROOT: A node which doesn't have a parent. In the above tree. The Root is A.
TREE: A tree is a finite set of one or more nodes such that there is a specially designated node called the Root, and zero or more non empty sub trees T 1, T 2...T k, each of whose roots are connected
Lecture 22 Tuesday, April 10
CIS 160 - Spring 2018 (instructor Val Tannen) Lecture 22 Tuesday, April 10 GRAPH THEORY Directed Graphs Directed graphs (a.k.a. digraphs) are an important mathematical modeling tool in Computer Science,
Graph Theory and Applications
Graph Theory and Applications with Exercises and Problems Jean-Claude Fournier WILEY Table of Contents Introduction 17 Chapter 1. Basic Concepts 21 1.1 The origin of the graph concept 21 1.2 Definition
Binary Trees
Binary Trees 4-7-2005 Opening Discussion What did we talk about last class? Do you have any code to show? Do you have any questions about the assignment? What is a Tree? You are all familiar with what
EE 368. Weeks 5 (Notes)
EE 368 Weeks 5 (Notes) 1 Chapter 5: Trees Skip pages 273-281, Section 5.6 - If A is the root of a tree and B is the root of a subtree of that tree, then A is B s parent (or father or mother) and B is A
Major Themes. Trees. Types of Graphs. Which of the following are trees? G 3 G 1 G 2 G 4. Dr Papalaskari 1
Major Themes Trees Villanova University Trees Binary trees Binary search trees Spanning trees Minimum spanning trees Villanova CSC 1300 - Dr Papalaskari 2 Types of Graphs graph mulhgraph digraph: directed
Computer Science 280 Fall 2002 Homework 10 Solutions
Computer Science 280 Fall 2002 Homework 10 Solutions Part A 1. How many nonisomorphic subgraphs does W 4 have? W 4 is the wheel graph obtained by adding a central vertex and 4 additional "spoke" edges
Graphs - I CS 2110, Spring 2016
Graphs - I CS 2110, Spring 2016 Announcements Reading: Chapter 28: Graphs Chapter 29: Graph Implementations These aren t the graphs we re interested in These aren t the graphs we re interested in This
LECTURE 26 PRIM S ALGORITHM
DATA STRUCTURES AND ALGORITHMS LECTURE 26 IMRAN IHSAN ASSISTANT PROFESSOR AIR UNIVERSITY, ISLAMABAD STRATEGY Suppose we take a vertex Given a single vertex v 1, it forms a minimum spanning tree on one
CHAPTER 10 GRAPHS AND TREES. Alessandro Artale UniBZ - artale/
CHAPTER 10 GRAPHS AND TREES Alessandro Artale UniBZ - http://www.inf.unibz.it/ artale/ SECTION 10.5 Trees Copyright Cengage Learning. All rights reserved. Trees In mathematics, a tree is a connected graph
Minimum spanning trees
Carlos Moreno cmoreno @ uwaterloo.ca EI-3 https://ece.uwaterloo.ca/~cmoreno/ece5 Standard reminder to set phones to silent/vibrate mode, please! During today's lesson: Introduce the notion of spanning
UNIT III TREES. A tree is a non-linear data structure that is used to represents hierarchical relationships between individual data items.
UNIT III TREES A tree is a non-linear data structure that is used to represents hierarchical relationships between individual data items. Tree: A tree is a finite set of one or more nodes such that, there
CS 151. Binary Trees. Friday, October 5, 12
CS 151 Binary Trees 1 Binary Tree Examples Without telling you what a binary tree is, here are some examples (that I will draw on the board): The dots/circles are called nodes, or vertices (singular: one
DOMINATION IN SOME CLASSES OF DITREES
BULLETIN OF THE INTERNATIONAL MATHEMATICAL VIRTUAL INSTITUTE ISSN (p) 20-4874, ISSN (o) 20-4955 www.imvibl.org /JOURNALS / BULLETIN Vol. 6(2016), 157-167 Former BULLETIN OF THE SOCIETY OF MATHEMATICIANS
Lecture 13. Reading: Weiss, Ch. 9, Ch 8 CSE 100, UCSD: LEC 13. Page 1 of 29
Lecture 13 Connectedness in graphs Spanning trees in graphs Finding a minimal spanning tree Time costs of graph problems and NP-completeness Finding a minimal spanning tree: Prim s and Kruskal s algorithms
r=1 The Binomial Theorem. 4 MA095/98G Revision
Revision Read through the whole course once Make summary sheets of important definitions and results, you can use the following pages as a start and fill in more yourself Do all assignments again Do the
DEFINITION OF GRAPH GRAPH THEORY GRAPHS ACCORDING TO THEIR VERTICES AND EDGES EXAMPLE GRAPHS ACCORDING TO THEIR VERTICES AND EDGES
DEFINITION OF GRAPH GRAPH THEORY Prepared by Engr. JP Timola Reference: Discrete Math by Kenneth H. Rosen A graph G = (V,E) consists of V, a nonempty set of vertices (or nodes) and E, a set of edges. Each
Trees and Intro to Counting
Trees and Intro to Counting CSE21 Winter 2017, Day 15 (B00), Day 10/11 (A00) February 15, 2017 http://vlsicad.ucsd.edu/courses/cse21-w17 Another Special Type of Graph: Trees (Rooted) Trees: definitions
Binary Trees, Binary Search Trees
Binary Trees, Binary Search Trees Trees Linear access time of linked lists is prohibitive Does there exist any simple data structure for which the running time of most operations (search, insert, delete)