articulationpoints割点.ppt

Graph Connectivity Connected Components Biconnectivity Biconnectivity DFS revisited DFS revisited DFS results representation Determining Articulation points Determining Articulation points Determining Articulation pointsRoot Node Special Case Determining Articulation points Determining Articulation points - runtime Union-Find Algorithms Union-Find Algorithms Union-Find Algorithms Union-Find Algorithms - Prerequisites Union-Find Algorithms Union-Find Algorithms Union-Find Algorithms Union-Find Algorithms Union-Find Algorithms This discussion concerns connected components of a graph. Previously, we discussed depth-first search (DFS) as a means of determining connected components. Here, we are concerned with whether there is more than one way to get from one vertex to another. We’ll look at a generalization of connectivity known as biconnectivity. A graph is said to be biconnected if and only if there are at least two different paths connecting each pair of vertices. So even if a vertex and all the edges touching it are removed, the graph is still connected. J L M J L K M biconnected Not biconnected An articulation point in a connected graph is a vertex that, if deleted, would break the graph into two or more pieces. A graph with no articulation point is said to be biconnected. J L K M A B C G F D E H I A graph that is not biconnected divides into biconnected components, sets of nodes mutually accessible via two distinct paths. This graph consists of the biconnected components {A,C,G,D,E,F}, {G,J,L,M}, {B}, {H}, {I}, and {K}. J L K M A B C G F D E H I A B C G F D E A B C G F D E A B C G F D E A B C G F D E A B C G F D E A B C G F D E A B C G F D E A B C G F D E A B C G F D E A B C G F D E A B C G F D E A B C F E D G Solid lines indicate that the lower vertex was found by the algorithm to be on the edge list of the upper vertex, and had not been visited at the time, so that a recursive call was made. Dotted lines correspond to edges to vertices that had already bee