CS 312: Algorithm Design & Analysis Lecture #17: Connectedness in Graphs This work is licensed under a Creative Commons Attribution-Share Alike 3.0 Unported.

Slides:

Advertisements

Similar presentations

What is a graph ? G=(V,E) V = a set of vertices E = a set of edges edge = unordered pair of vertices

Advertisements

Elementary Graph Algorithms Depth-first search.Topological Sort. Strongly connected components. Chapter 22 CLRS.

More Graphs COL 106 Slides from Naveen. Some Terminology for Graph Search A vertex is white if it is undiscovered A vertex is gray if it has been discovered.

CS 312 – Graph Algorithms1 Graph Algorithms Many problems are naturally represented as graphs – Networks, Maps, Possible paths, Resource Flow, etc. Ch.

Graphs – Depth First Search ORD DFW SFO LAX

16a-Graphs-More (More) Graphs Fonts: MTExtra:  (comment) Symbol:  Wingdings: Fonts: MTExtra:  (comment) Symbol:  Wingdings:

CS 473Lecture 151 CS473-Algorithms I Lecture 15 Graph Searching: Depth-First Search and Topological Sort.

David Luebke 1 5/20/2015 CS 332: Algorithms Graph Algorithms.

UMass Lowell Computer Science Analysis of Algorithms Prof. Karen Daniels Spring, 2001 Makeup Lecture Chapter 23: Graph Algorithms Depth-First SearchBreadth-First.

Graph Traversals Reading Material: Chapter 9. Graph Traversals Some applications require visiting every vertex in the graph exactly once. The application.

Testing for Connectedness and Cycles

1 Data Structures DFS, Topological Sort Dana Shapira.

Lecture 10 Topics Application of DFS Topological Sort

CSE 780 Algorithms Advanced Algorithms Graph Alg. DFS Topological sort.

Lecture 16 CSE 331 Oct 9, Announcements Hand in your HW4 Solutions to HW4 next week Remember next week I will not be here so.

CS344: Lecture 16 S. Muthu Muthukrishnan. Graph Navigation BFS: DFS: DFS numbering by start time or finish time. –tree, back, forward and cross edges.

1 7/3/2015 ITCS 6114 Graph Algorithms. 2 7/3/2015 Depth-First Search ● Depth-first search is another strategy for exploring a graph ■ Explore “deeper”

CS 312: Algorithm Analysis Lecture #16: Strongly Connected Components This work is licensed under a Creative Commons Attribution-Share Alike 3.0 Unported.

Depth-First Search Idea: Keep going forward as long as there are unseen nodes to be visited. Backtrack when stuck. v G G G G is completely traversed.

CS 312: Algorithm Analysis

CS 312: Algorithm Design & Analysis Lecture #34: Branch and Bound Design Options for Solving the TSP: Tight Bounds This work is licensed under a Creative.

David Luebke 1 10/1/2015 CS 332: Algorithms Topological Sort Minimum Spanning Tree.

Spring 2015 Lecture 10: Elementary Graph Algorithms

CSC 213 – Large Scale Programming. Today’s Goals  Make Britney sad through my color choices  Revisit issue of graph terminology and usage  Subgraphs,

Nattee Niparnan. Graph  A pair G = (V,E)  V = set of vertices (node)  E = set of edges (pairs of vertices)  V = (1,2,3,4,5,6,7)  E = ((1,2),(2,3),(3,5),(1,4),(4,

CS 312: Algorithm Analysis Lecture #8: Non-Homogeneous Recurrence Relations This work is licensed under a Creative Commons Attribution-Share Alike 3.0.

CS 312: Algorithm Design & Analysis Lecture #12: Average Case Analysis of Quicksort This work is licensed under a Creative Commons Attribution-Share Alike.

Discussion #32 1/13 Discussion #32 Properties and Applications of Depth-First Search Trees.

Lecture 13 Jianjun Hu Department of Computer Science and Engineering University of South Carolina CSCE350 Algorithms and Data Structure.

CSC 413/513: Intro to Algorithms Graph Algorithms DFS.

CS 312: Algorithm Design & Analysis Lecture #35: Branch and Bound Design Options: State Spaces Slides by: Eric Ringger, with contributions from Mike Jones,

Lecture 11 Algorithm Analysis Arne Kutzner Hanyang University / Seoul Korea.

Jan Topological Order and SCC Edge classification Topological order Recognition of strongly connected components.

Topological Sort (an application of DFS) CSC263 Tutorial 9.

1 Chapter 22 Elementary Graph Algorithms. 2 Introduction G=(V, E) –V = vertex set –E = edge set Graph representation –Adjacency list –Adjacency matrix.

 2004 SDU Lectrue4-Properties of DFS Properties of DFS Classification of edges Topological sort.

Chapter 22: Elementary Graph Algorithms

Analysis of Algorithms CS 477/677 Instructor: Monica Nicolescu Lecture 20.

Slides by: Eric Ringger, adapted from slides by Stuart Russell of UC Berkeley. CS 312: Algorithm Design & Analysis Lecture #36: Best-first State- space.

CS 312: Algorithm Analysis Lecture #33: Branch and Bound, Job Assignment This work is licensed under a Creative Commons Attribution-Share Alike 3.0 Unported.

Properties and Applications of Depth-First Search Trees and Forests

CS 312: Algorithm Analysis Lecture #31: Linear Programming: the Simplex Algorithm, part 2 This work is licensed under a Creative Commons Attribution-Share.

CS 312: Algorithm Analysis Lecture #35: Branch and Bound Design Options - State Spaces Slides by: Eric Ringger, with contributions from Mike Jones, Eric.

CS 312: Algorithm Analysis Lecture #31: Linear Programming: the Simplex Algorithm, part 2 This work is licensed under a Creative Commons Attribution-Share.

Hello Everyone!!! 1. Tree And Graphs 2 Features of Trees  Tree Nodes Each node have 0 or more children A node have must one parent  Binary tree Tree.

ALGORITHMS THIRD YEAR BANHA UNIVERSITY FACULTY OF COMPUTERS AND INFORMATIC Lecture nine Dr. Hamdy M. Mousa.

7 Finding Bridge in a Graph. What is a bridge ? A C D B F G E.

CS 312: Algorithm Analysis Lecture #9: Recurrence Relations - Change of Variable Slides by: Eric Ringger, with contributions from Mike Jones, Eric Mercer,

CS 312: Algorithm Design & Analysis Lecture #26: 0/1 Knapsack This work is licensed under a Creative Commons Attribution-Share Alike 3.0 Unported License.Creative.

CS 312: Algorithm Design & Analysis Lecture #29: Network Flow and Cuts This work is licensed under a Creative Commons Attribution-Share Alike 3.0 Unported.

CS 312: Algorithm Analysis Lecture #30: Linear Programming: Intro. to the Simplex Algorithm This work is licensed under a Creative Commons Attribution-Share.

Hw. 6: Algorithm for finding strongly connected components. Original digraph as drawn in our book and in class: Preorder label : Postorder label Nodes:

GRAPH ALGORITHM. Graph A pair G = (V,E) – V = set of vertices (node) – E = set of edges (pairs of vertices) V = (1,2,3,4,5,6,7) E = ( (1,2),(2,3),(3,5),(1,4),(4,5),(6,7)

CS 312: Algorithm Analysis Lecture #27: Network Flow This work is licensed under a Creative Commons Attribution-Share Alike 3.0 Unported License.Creative.

11 Graph Search Algorithms. 2 What parts of the graph are reachable from a given vertex ?

November 22, Algorithms and Data Structures Lecture XII Simonas Šaltenis Nykredit Center for Database Research Aalborg University

CSC317 1 At the same time: Breadth-first search tree: If node v is discovered after u then edge uv is added to the tree. We say that u is a predecessor.

Chapter 22: Elementary Graph Algorithms Overview: Definition of a graph Representation of graphs adjacency list matrix Elementary search algorithms breadth-first.

Spanning Trees Alyce Brady CS 510: Computer Algorithms.

Breadth-First Search (BFS)

Depth-First Search Depth-first search is a strategy for exploring a graph Explore “deeper” in the graph whenever possible Edges are explored out of the.

Topological Sort (an application of DFS)

Data Structures & Algorithms Digraphs and DAGs

Many slides here are based on E. Demaine , D. Luebke slides

Lecture 10 Algorithm Analysis

Advanced Algorithms Analysis and Design

Elementary graph algorithms Chapter 22

Topological Sort (an application of DFS)

Trevor Brown DC 2338, Office hour M3-4pm

Elementary graph algorithms Chapter 22

Presentation transcript:

CS 312: Algorithm Design & Analysis Lecture #17: Connectedness in Graphs This work is licensed under a Creative Commons Attribution-Share Alike 3.0 Unported License.Creative Commons Attribution-Share Alike 3.0 Unported License Slides by: Eric Ringger, adapting figures from Dasgupta et al.

Announcements  Due now:  HW #13  Project #4  Wednesday: Whiteboard Experience  Friday: Early Day  Virtual Monday = Tuesday: Due  Technical Career Fair: Thursday 9am-3pm in Wilkinson Student Center  Preview: Wednesday 4:00pm in 1170 TMCB  This Week  According to schedule!

Objectives  Wrap up connectedness in Undirected Graphs  DFS on Directed Graphs  Understand how to linearize a DAG

Many Kinds of Connectedness

DFS Analysis “Non-committal Case”: Our generic analysis covers best and worst cases.

DFS Yields a Forest

Directed Graphs  Let’s switch gears to directed graphs now

DFS on Directed Graphs

Edge Types  Tree edges: part of the DFS forest  Forward edges: lead to a non- child descendant in the DFS tree.  Back edges: lead to an ancestor in the DFS tree.  Cross edges: lead to a node that has already been completely explored (that is, already post-visited)  lead to neither descendant nor ancestor

Classifying Edge Types Pre Post ?

Classifying Edge Types Pre Post

Classifying Edge Types Pre Post ?

Classifying Edge Types Pre Post

Classifying Edge Types Pre Post < ?

Classifying Edge Types Pre Post <

Classify Edge

Cycles  How do you detect a cycle in a directed graph?  Property: A directed graph has a cycle if and only if its depth-first search reveals a back edge.  Otherwise: a Directed Acyclic Graph (DAG)

Sources, Sinks, Linearization DFS Search Forest: Linearization of the DAG == Topological Ordering of the DAG: 0. Define order; 1. DFS; 2. Read off post-order values in reverse order Analysis: Input DAG:

Sources, Sinks, Linearization DFS Search Forest: Linearization of the DAG == Topological Ordering of the DAG: 0. Define order; 1. DFS; 2. Read off post-order values in reverse order Analysis: Input DAG:

Sources, Sinks, Linearization DFS Search Forest: Linearized DAG: 0. Define order; 1. DFS; 2. Read off post-order values in reverse order Analysis:

Sources, Sinks, Linearization  In our DAG, what do you notice about sources, sinks and post-order numbers?

Assignment  HW 13.5  Whiteboard Experience for Project #4