数据结构陈越CS_DS06b Connected Components.pptVIP

* §2 Elementary graph Operations 3. Connected Components (1) Is the graph connected? ? Call dfs(0) or bfs(0) —— O( e ) ? Check if there is any vertices missing —— O( n ) Tp = O( n + e ) (2) List the connected components of G void connected ( void ) { /* determine the connected components of a graph */ int i ; for ( i = 0; i n; i++ ) if ( !visited[ i ] ) { dfs ( i ) ; /* bfs can be used with no change in Tp */ printf ( “\n” ); } /* end if */ } O( n ) O( ei1 + ei2 + ... ) = O( e ) Tp = O( n + e ) §2 Elementary graph Operations 4. Spanning Tree —— a tree which consists of V( G ) and a subset of E( G ) 〖Example〗 A complete graph and three of its spanning trees 【Remarks】 ? E( G ) = T + N where T is for tree edges and N for non-tree edges. ? T consists of the edges traversed by the search program. We can add a piece of code to collect these edges into a linked list T. §2 Elementary graph Operations 【Remarks】 ? dfs and bfs give different spanning trees. 0 2 1 3 0 2 1 3 ? Adding an edge in N to a spanning tree, we obtain a cycle. ? If we introduce the edges in N into the spanning tree one at a time, then we obtain a cycle basis —— that is, all the cycles are independent, and all other cycles in G can be constructed as a linear combination of the cycles in the basis. ? A spanning tree is a minimal subgraph. That is, G’ ? G such that V( G’ ) = V( G ), G’ is connected, and E( G’ ) is minimal. ? G is connected ? e ? n ? 1, and G is connected and e = n ? 1 ? G is a tree. ? e = n ? 1 for a spanning tree. §2 Elementary graph Operations 5. Biconnected Components and Articulation Points ? ? ? ? ? Articulation point Biconnected graph ? v is an articulation point if G’ = DeleteVertex( G, v ) has at least 2 connected components. ? G is a biconnected graph if G is connected and has no articulation points. ? A biconnected component is a maximal biconnected subgraph. 〖Example〗 0 1 2 3 4 8 7 5