Searching on Graphs November 16, 2016 CMPE 250 Graphs- Searching on - PowerPoint PPT Presentation

Searching on Graphs November 16, 2016 CMPE 250 Graphs- Searching on Graphs November 16, 2016 1 / 78

Breadth-First and Depth-First Search CMPE 250 Graphs- Searching on Graphs November 16, 2016 2 / 78

Breadth-First Search(BFS) – Basic Idea Given a graph with N vertices and a selected vertex A : for (i = 1; there are unvisited vertices ; i++) Visit all unvisited vertices at distance i (i is the length of the shortest path between A and currently processed vertices) Queue-based implementation CMPE 250 Graphs- Searching on Graphs November 16, 2016 3 / 78

BFS – Algorithm Store source vertex S in a queue and mark as processed 1 while queue is not empty 2 Read vertex v from the queue for all neighbors w: If w is not processed Mark as processed Enqueue in the queue Record the parent of w to be v (necessary only if we need the shortest path tree) CMPE 250 Graphs- Searching on Graphs November 16, 2016 4 / 78

BFS-example CMPE 250 Graphs- Searching on Graphs November 16, 2016 5 / 78

BFS – Complexity Step 1 : read a node from the queue O ( | V | ) times. Step 2 : examine all neighbors, i.e. we examine all edges of the currently read node. Hence the complexity of BFS is O ( | V | + | E | ) Undirected graph: 2 × | E | edges to examine CMPE 250 Graphs- Searching on Graphs November 16, 2016 15 / 78

Depth-First Search Procedure dfs(s) mark all vertices in the graph as not reached invoke scan(s) Procedure scan(s) mark and visit s for each neighbor w of s if the neighbor is not reached invoke scan(w) CMPE 250 Graphs- Searching on Graphs November 16, 2016 16 / 78

Depth-First Search with Stack Initialization: mark all vertices as unvisited, visit(s) while the stack is not empty: pop (v,w) if w is not visited add (v,w) to tree T visit(w) Procedure visit(v) mark v as visited for each edge (v,w) push (v,w) in the stack CMPE 250 Graphs- Searching on Graphs November 16, 2016 17 / 78

Recursive DFS procedure DepthFirst(Vertex v) visit(v); for each neighbor w of v if (w is not visited) add edge (v,w) to tree T DepthFirst(w) procedure visit(v) mark v as visited CMPE 250 Graphs- Searching on Graphs November 16, 2016 18 / 78

DFS-example CMPE 250 Graphs- Searching on Graphs November 16, 2016 19 / 78

Example Adjacency lists 1: 2, 3, 4 2: 6, 3, 1 3: 1, 2, 6, 5, 4 4: 1, 3, 5 5: 3, 4 6: 2, 3 Depth first traversal: 1, 2, 6, 3, 5, 4 The particular order is dependent on the order of nodes in the adjacency lists CMPE 250 Graphs- Searching on Graphs November 16, 2016 37 / 78

Applications of Depth-First Search Graph Connectivity Connectivity Biconnectivity Articulation Points and Bridges Connectivity in Directed Graphs CMPE 250 Graphs- Searching on Graphs November 16, 2016 38 / 78

Connectivity Definition: An undirected graph is said to be connected if for any pair of nodes of the graph, the two nodes are reachable from one another (i.e. there is a path between them). If starting from any vertex we can visit all other vertices, then the graph is connected CMPE 250 Graphs- Searching on Graphs November 16, 2016 39 / 78

Biconnectivity A graph is biconnected, if there are no vertices whose removal will disconnect the graph. not biconnected biconnected CMPE 250 Graphs- Searching on Graphs November 16, 2016 40 / 78

Articulation Points Definition: A vertex whose removal makes the graph disconnected is called an articulation point or cut-vertex C is an articulation point We can compute articulation points using depth-first search and a special numbering of the vertices in the order of their visiting. CMPE 250 Graphs- Searching on Graphs November 16, 2016 41 / 78

Bridges Definition: An edge in a graph is called a bridge, if its removal disconnects the graph. Any edge in a graph, that does not lie on a cycle, is a bridge. Obviously, a bridge has at least one articulation point at its end, however an articulation point is not necessarily linked in a bridge. (C,D) and (E,D) are bridges CMPE 250 Graphs- Searching on Graphs November 16, 2016 42 / 78

Example 1 C is an articulation point, there are no bridges CMPE 250 Graphs- Searching on Graphs November 16, 2016 43 / 78

Example 2 C is an articulation point, (C,B) is a bridge CMPE 250 Graphs- Searching on Graphs November 16, 2016 44 / 78

Example 3 B and C are articulation points, (B,C) is a bridge CMPE 250 Graphs- Searching on Graphs November 16, 2016 45 / 78

Example 4 B and C are articulation points. All edges are bridges CMPE 250 Graphs- Searching on Graphs November 16, 2016 46 / 78

Example 5 Biconnected graph - no articulation points and no bridges CMPE 250 Graphs- Searching on Graphs November 16, 2016 47 / 78

Connectivity in Directed Graphs (I) Definition: A directed graph is said to be strongly connected if for any pair of nodes there is a path from each one to the other CMPE 250 Graphs- Searching on Graphs November 16, 2016 48 / 78

Connectivity in Directed Graphs (II) Definition: A directed graph is said to be unilaterally connected if for any pair of nodes at least one of the nodes is reachable from the other Each strongly connected graph is also unilaterally connected. CMPE 250 Graphs- Searching on Graphs November 16, 2016 49 / 78

Shortest Paths CMPE 250 Graphs- Searching on Graphs November 16, 2016 50 / 78

Unweighted Directed Graphs What is the shortest path from V3 to V5? CMPE 250 Graphs- Searching on Graphs November 16, 2016 51 / 78

Problem Data The problem: Given a source vertex s , find the shortest path to all other vertices. Data structures needed: Graph representation: Adjacency lists / adjacency matrix Distance table: distances from source vertex paths from source vertex CMPE 250 Graphs- Searching on Graphs November 16, 2016 52 / 78

Problem Data Adjacency lists : Let s = V3, stored in a queue V1: V2, V4 Initialized distance table: V2: V4, V5 V3: V1, V6 Vertex Distance Parent V4: V3, V5, V6, V7 V1 -1 -1 V5: V7 V2 -1 -1 V6: - V3 0 0 V7: V6 V4 -1 -1 V5 -1 -1 V6 -1 -1 CMPE 250 Graphs- Searching on Graphs November 16, 2016 53 / 78

Breadth-first search in graphs Take a vertex and examine all adjacent vertices. Do the same with each of the adjacent vertices . CMPE 250 Graphs- Searching on Graphs November 16, 2016 54 / 78

Algorithm Store s in a queue, and initialize distance = 0 in the Distance Table 1 While there are vertices in the queue: 2 Read a vertex v from the queue For all adjacent vertices w : If distance = -1 (not computed) Distance = (distance to v) + 1 Parent = v Append w to the queue CMPE 250 Graphs- Searching on Graphs November 16, 2016 55 / 78

Complexity Matrix representation: O ( | V | 2 ) Adjacency lists - O ( | E | + | V | ) We examine all edges ( O ( | E | ) ), and we store in the queue each vertex only once ( O ( | V | ) ). CMPE 250 Graphs- Searching on Graphs November 16, 2016 56 / 78

Searching on Graphs November 16, 2016 CMPE 250 Graphs- Searching on - PowerPoint PPT Presentation

Searching on Graphs November 16, 2016 CMPE 250 Graphs- Searching on Graphs November 16, 2016 1 / 78 Breadth-First and Depth-First Search CMPE 250 Graphs- Searching on Graphs November 16, 2016 2 / 78 Breadth-First Search(BFS) Basic Idea

CMPSCI 187: Programming With Data Structures Lecture #32: Searching Graphs David Mix Barrington

Searching Uniquely Hamiltonian Planar Graphs with Minimum Degree 3 Benedikt Klocker, Herbert

Graph Searching CSE 373 Data Structures Lecture 20 Readings Reading Sections 9.5 and

GraphBlast: multi-feature graphs database searching Alfredo Ferro, Rosalba Giugno, Misael

Chasing robbers on random graphs: zigzag theorem Pawe Praat Department of Mathematics, West

Linguistics 384: Language and Computers Operators Searching the web Topic 2: Searching

Searching Tiziana Ligorio 1 Todays Plan Searching algorithms and their analysis 2

Chapter 5 Searching and Binary Search Trees 5.1 Searching sequence The purpose of searching :

Graphs () Graphs () Graphs Graphs Graphs are collections of nodes

Graphs Graphs Examples Definitions Implementation/Representation of graphs Graphs

Searching and Sorting Mason Vail, Boise State University Computer Science Searching Searching is

#3: Trademark Two Problems Eric R. Waltmire Searching Patent Attorney 1. Not Searching 2.

CS 162 Intro to Programming II Searching 1 Searching

Graphs Graphs Simple graphs Algorithms Depth-first search Breadth-first search

Weighted graphs 2 Weighted graphs So far we have only considered weighted graphs with

Sorting and Searching Topic 11 Sorting and Searching S ti d S hi Fundamental problems in

POSETS OF COPIES, EMBEDDING MONOIDS, AND INTERPRETABILITY OF RELATIONAL STRUCTURES Milo s

Query Decompositions survey Nicola Onose January 19, 2007 Nicola Onose Query Decompositions

Connection Matrices and Definability of Graph Invariants Johann A. Makowsky Faculty of Computer

Data Structures Fibonacci Heaps, Union Find Algorithm Theory WS 2012/13 Fabian Kuhn Fibonacci

Introduction to Computer Graphics Toshiya Hachisuka Last Time Introduction to ray tracing

CS4495/6495 Introduction to Computer Vision 5A-L1 Photometry Slides by Yin Li Thanks to

To Do Computer Graphics (Fall 2004) Submit HW 3, do well Start early on HW 4 COMS 4160,

Computer Graphics - Material Models - Philipp Slusallek REFLECTANCE PROPERTIES 2 Appearance