Download presentation

Presentation is loading. Please wait.

Published byVictoria Strickland Modified over 2 years ago

1
1 Chapter 22: Elementary Graph Algorithms IV

2
2 About this lecture Review of Strongly Connected Components (SCC) in a directed graph Finding all SCC (i.e., decompose a directed graph into SCC)

3
3 Let G be a directed graph Let u and v be two vertices in G Definition: If u can reach v (by a path) and v can reach u (by a path), then we say u and v are mutually reachable We shall use the notation u v to indicate u and v are mutually reachable Also, we assume u u for any node u Mutually Reachable

4
4 Theorem: is an equivalence relation Proof: By assumption u u, so is reflexive If u v, then v u, so is symmetric Also, if u v and v w, then u w, so is transitive Thus, is an equivalence relation

5
5 Strongly Connected Components Thus, we can partition V based on Let V 1, V 2, …, V k denote the partition Each V i is called a strongly connected component (SCC) of G E.g., v rs wx tu y

6
6 Property of SCC Let G = (V, E) be a directed graph Let G T be a graph obtained from G by reversing the direction of every edge in G Adjacency matrix of G T = transpose of adjacency matrix of G Theorem: G and G T has the same set of SCC ’s

7
7 Property of SCC Let V 1, V 2, …, V k denote SCC of a graph G Let G SCC be a simple graph obtained by contracting each V i into a single vertex v i We call G SCC the component graph of G v rs wx tu y G V1V1 V2V2 V3V3 G SCC v1v1 v2v2 v3v3

8
8 Property of G SCC Theorem: G SCC is acyclic Proof: (By contradiction) If G SCC has a cycle, then there are some vertices v i and v j with v i v j By definition, v i and v j correspond to two distinct SCC V i and V j in G. However, we see that any pair of vertices in V i and V j are mutually reachable contradiction

9
9 Property of G SCC Suppose the DAG (directed acyclic graph) on the right side is the G SCC of some graph G v1v1 v2v2 v3v3 v5v5 v4v4 v6v6 Now, suppose we perform DFS on G let u = node with largest finishing time Question: Which SCC can u be located ? (see next Lemma)

10
10 Property of G SCC Lemma: Consider any graph G. Let G SCC be its component graph. Suppose v is a vertex in G SCC with at least one incoming edge. Then, the node u finishing last in any DFS of G cannot be a vertex of the SCC corresponding to v

11
11 Proof Let SCC(v) = SCC corresponding to v Since v has incoming edge, there exists w such that (w,v) is an edge in G SCC Inside G SCC w v In the next two slides, we shall show that some node in SCC(w) must finish later than any node in SCC(v) Consequently, u cannot be in SCC(v)

12
12 Proof Let x = 1st node in SCC(w) discovered by DFS Let y = 1st node in SCC(v) discovered by DFS Let z = last node in SCC(v) finished by DFS // Note: z may be the same as y By white-path theorem, we must have d(y) d(z) f(z) f(y) Inside G SCC(w)SCC(v) x y z

13
13 Proof If d(x) d(y) then y becomes x’s descendant (by white-path) f(z) f(y) f(x) If d(y) d(x) since x cannot be y’s descendant (otherwise, they are in the same SCC) d(y) f(y) d(x) f(x) f(z) f(y) f(x) Inside G SCC(w)SCC(v) x y z

14
14 Finding SCC So, we know that u (last finished node of G) must be in an SCC with no incoming edges Let us reverse edge directions, and start DFS on G T from u v1v1 v2v2 v3v3 v5v5 v4v4 v6v6 Question: Who will be u’s descendants ?? v1v1 v2v2 v3v3 v5v5 v4v4 v6v6 New G SCC

15
15 Finding SCC Note that nodes in the SCC containing u cannot connect to nodes in other SCCs in G T By white-path theorem, the descendants of u in G T must be exactly those nodes in the same SCC as u v1v1 v2v2 v3v3 v5v5 v4v4 v6v6 v1v1 v2v2 v3v3 v5v5 v4v4 v6v6 New G SCC

16
16 Finding SCC Once DFS on u inside G T has finished, all nodes in the same SCC as u are finished Any subsequent DFS in G T will be made as if this SCC was removed from G T Now, let u’ be the remaining node in G T whose finishing time (in DFS in G) is latest Where can u’ be located? Who will be the descendents of u’ if we perform DFS in G T now?

17
17 Our observations lead to the following algorithm for finding all SCCs of G : Finding-all-SCC(G) { 1. Perform DFS on G ; 2. Construct G T ; 3. while (some node in G T is undiscovered) { u = undiscovered node with latest finishing time** ; Perform DFS on G T from u ; } // nodes in the DFS tree from u forms an SCC } // ** Finishing times always refer to Step 1’s DFS

18
18 Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.

19
19 Correctness & Performance The correctness of the algorithm can be proven by induction (Hint: Show that at each sub-search in Step 3, u is chosen from an SCC which has no outgoing edges to any nodes in an “unvisited” SCC of G T. By white-path theorem, exactly all nodes in the same SCC become u’s descendants) Running Time: O(|V|+|E|) (why?)

20
20 Homework Exercises: 22.5-2, 22.5-3 (due: Dec. 12) Practice at home: 22.5-6

Similar presentations

Presentation is loading. Please wait....

OK

Theory of Computing Lecture 6 MAS 714 Hartmut Klauck.

Theory of Computing Lecture 6 MAS 714 Hartmut Klauck.

© 2017 SlidePlayer.com Inc.

All rights reserved.

Ads by Google

Ppt on testing of turbo generators manufacturers Ppt on teachings of buddha Ppt on different types of houses Ppt on polynomials and coordinate geometry pdf Ppt on south africa culture and customs Ppt on addition of integers Ppt on the rise of nationalism in europe Ppt on six sigma Ppt on ganga river system Ppt on art and craft movement pottery