Graph Basics Lecturer: Shi Li Department of Computer Science and - PowerPoint PPT Presentation

Depth-First Search (DFS) Starting from s Travel through the first edge leading out of the current vertex When reach an already-visited vertex (“dead-end”), go back Travel through the next edge If tried all edges leading out of the current vertex, go back 14/28

Depth-First Search (DFS) Starting from s Travel through the first edge leading out of the current vertex When reach an already-visited vertex (“dead-end”), go back Travel through the next edge If tried all edges leading out of the current vertex, go back 1 7 2 3 4 5 8 6 14/28

Implementing DFS using a Stack DFS ( s ) head ← 1 , stack [1] ← s 1 mark all vertices as “unexplored” 2 while head ≥ 1 3 v ← stack [ head ] , head ← head − 1 4 if v is unexplored then 5 mark v as “explored” 6 for all neighbours u of v 7 if u is not explored then 8 head ← head + 1 , stack [ head ] = u 9 Running time: O ( n + m ) . 15/28

Example of DFS using Stack head 1 7 2 3 1 4 5 8 6 explored vertices: 16/28

Example of DFS using Stack v head 1 7 2 3 4 5 8 6 explored vertices: 16/28

Example of DFS using Stack v head 1 7 2 3 4 5 8 6 1 explored vertices: 16/28

Example of DFS using Stack v head 1 7 2 3 3 2 4 5 8 6 1 explored vertices: 16/28

Example of DFS using Stack head 1 7 v 2 3 3 4 5 8 6 1 explored vertices: 16/28

Example of DFS using Stack head 1 7 v 2 3 3 4 5 8 6 1 2 explored vertices: 16/28

Example of DFS using Stack head 1 7 v 2 3 3 5 4 3 4 5 8 6 1 2 explored vertices: 16/28

Example of DFS using Stack head 1 7 v 2 3 3 5 4 4 5 8 6 1 2 explored vertices: 16/28

Example of DFS using Stack head 1 7 v 2 3 3 5 4 4 5 8 6 1 2 3 explored vertices: 16/28

Example of DFS using Stack head 1 7 v 2 3 3 5 4 8 7 5 4 5 8 6 1 2 3 explored vertices: 16/28

Example of DFS using Stack head 1 7 2 3 3 5 4 8 7 v 4 5 8 6 1 2 3 explored vertices: 16/28

Example of DFS using Stack head 1 7 2 3 3 5 4 8 7 v 4 5 8 6 1 2 3 5 explored vertices: 16/28

Example of DFS using Stack head 1 7 2 3 3 5 4 8 7 6 4 v 4 5 8 6 1 2 3 5 explored vertices: 16/28

Example of DFS using Stack head 1 7 2 3 v 3 5 4 8 7 6 4 5 8 6 1 2 3 5 explored vertices: 16/28

Example of DFS using Stack head 1 7 2 3 v 3 5 4 8 7 6 4 5 8 6 1 2 3 5 4 explored vertices: 16/28

Example of DFS using Stack head 1 7 2 3 3 5 4 8 7 4 5 8 v 6 1 2 3 5 4 explored vertices: 16/28

Example of DFS using Stack head 1 7 2 3 3 5 4 8 7 4 5 8 v 6 1 2 3 5 4 6 explored vertices: 16/28

Example of DFS using Stack v head 1 7 2 3 3 5 4 8 4 5 8 6 1 2 3 5 4 6 explored vertices: 16/28

Example of DFS using Stack v head 1 7 2 3 3 5 4 8 4 5 8 6 1 2 3 5 4 6 7 explored vertices: 16/28

Example of DFS using Stack v head 1 7 2 3 3 5 4 8 8 4 5 8 6 1 2 3 5 4 6 7 explored vertices: 16/28

Example of DFS using Stack head 1 7 2 3 3 5 4 8 v 4 5 8 6 1 2 3 5 4 6 7 explored vertices: 16/28

Example of DFS using Stack head 1 7 2 3 3 5 4 8 v 4 5 8 6 1 2 3 5 4 6 7 8 explored vertices: 16/28

Example of DFS using Stack head 1 7 2 3 3 5 4 v 4 5 8 6 1 2 3 5 4 6 7 8 explored vertices: 16/28

Example of DFS using Stack head 1 7 2 3 v 3 5 4 5 8 6 1 2 3 5 4 6 7 8 explored vertices: 16/28

Example of DFS using Stack head 1 7 2 3 3 v 4 5 8 6 1 2 3 5 4 6 7 8 explored vertices: 16/28

Example of DFS using Stack head 1 7 v 2 3 4 5 8 6 1 2 3 5 4 6 7 8 explored vertices: 16/28

Implementing DFS using Recurrsion DFS( s ) mark all vertices as “unexplored” 1 recursive-DFS( s ) 2 recursive-DFS ( v ) if v is explored then return 1 mark v as “explored” 2 for all neighbours u of v 3 recursive-DFS( u ) 4 17/28

Outline Graphs 1 Connectivity and Graph Traversal 2 Testing Bipartiteness Topological Ordering 3 18/28

Testing Bipartiteness: Applications of BFS Def. A graph G = ( V, E ) is a bipartite graph if there is a partition of V into two sets L and R such that for every edge ( u, v ) ∈ E , we have either u ∈ L, v ∈ R or v ∈ L, u ∈ R . 19/28

Testing Bipartiteness Taking an arbitrary vertex s ∈ V 20/28

Testing Bipartiteness Taking an arbitrary vertex s ∈ V Assuming s ∈ L w.l.o.g 20/28

Testing Bipartiteness Taking an arbitrary vertex s ∈ V Assuming s ∈ L w.l.o.g Neighbors of s must be in R 20/28

Testing Bipartiteness Taking an arbitrary vertex s ∈ V Assuming s ∈ L w.l.o.g Neighbors of s must be in R Neighbors of neighbors of s must be in L 20/28

Testing Bipartiteness Taking an arbitrary vertex s ∈ V Assuming s ∈ L w.l.o.g Neighbors of s must be in R Neighbors of neighbors of s must be in L · · · 20/28

Testing Bipartiteness Taking an arbitrary vertex s ∈ V Assuming s ∈ L w.l.o.g Neighbors of s must be in R Neighbors of neighbors of s must be in L · · · Report “not a bipartite graph” if contradiction was found 20/28

Testing Bipartiteness Taking an arbitrary vertex s ∈ V Assuming s ∈ L w.l.o.g Neighbors of s must be in R Neighbors of neighbors of s must be in L · · · Report “not a bipartite graph” if contradiction was found If G contains multiple connected components, repeat above algorithm for each component 20/28

Test Bipartiteness 21/28

Graph Basics Lecturer: Shi Li Department of Computer Science and - PowerPoint PPT Presentation

CSE 431/531: Analysis of Algorithms Graph Basics Lecturer: Shi Li Department of Computer Science and Engineering University at Buffalo Outline Graphs 1 Connectivity and Graph Traversal 2 Testing Bipartiteness Topological Ordering 3 2/28

Graphs: The Basics 0 5 1 2 6 7 8 9 3 4 What is a graph? 0 5 1 2 6 7 8 9 3 4

Graph Basics Lecturer: Shi Li Department of Computer Science and Engineering University at

Graph Basics Lecturer: Shi Li Department of Computer Science and Engineering University at

Basics Of Graph Morphology Sravan Danda April 9, 2015 Table of contents Why Discrete

Week 9 - Friday What did we talk about last time? Graph basics Graph ADT Adjacency

Graph Essentials Graph Basics Social Media Mining Social Media Mining Measures and Metrics

The Graph Programming Language Ephraim Park, Peiqian Li, Qingxiang Jia Overview - Basics -

Digital Geometry Processing Basics University of British Columbia Mesh Basics: Definitions,

Graph Search Part I Lecture 15 Thursday, October 19, 2017 Graph Basics Sariel Har-Peled (UIUC)

Graph Thoery and Social Networks Nathan Feldman DRP Summer 2014 University of Maryland

Basics and Random Graphs Social and Technological Networks Rik Sarkar University of Edinburgh,

Graph Traversal Graph Traversal with DFS/BFS One of the most fundamental graph problems is to

GRAPH MINING AND GRAPH KERNELS Part I: Graph Mining Karsten Borgwardt^ and Xifeng Yan*

Graph Mining Marco Serafini COMPSCI 532 Lecture 11 Classes of Graph Systems Graph

Graph Colouring with Distances J AN VAN DEN H EUVEL Department of Mathematics London School of

Finding your way in a graph Finding your way in a graph Finding your way in a graph Finding your

Graph Sparsifiers Smaller graph that (approximately) preserves the values of some set of

The Decomposition of Graphs DPV Chapter 3 Jim Royer EECS February 6, 2019 Royer (EECS) Graph

GRAPH MINING AND GRAPH KERNELS Part II: Graph Kernels Karsten Borgwardt^ and Xifeng Yan*

1 Matrix notation and preliminaries from spectral graph theory Spectral graph theory studies

Graph Exploration w/ Neo4j 1

It's a Tree... It's a Graph... It's a Tree... It's a Graph... It's a Traph!!!! It's a Traph!!!!

Mria Markoov Graph definition Degree, in, out degree, oriented graph.

Whats left? How do we get from here to there? Need: 1. Common Vocabulary 2. Graph