图的双连接组件是最大双连接子图。如果图形不包含任何切割顶点,则将图形连接。
Decomposing a graph into its biconnected components helps to measure how well-connected the graph is. You can decompose any connected graph into a tree of biconnected components, called theblock-cut tree。The blocks in the tree are attached at shared vertices, which are the cut vertices.
插图描绘了: