tree= bctree(G)返回图形的块状树G,使每个节点在treerepresents either abiconnected componentor切顶点ofG。A node representing a cut vertex is connected to all nodes representing biconnected components that contain that cut vertex.
Plot the block-cut tree using red diamond markers for the nodes that represent cut vertices. The circular nodes represent the biconnected components in the original graph.
Also known as发音点,,,,cut vertices are graph nodes whose removal increases the number of connected components. In the previous illustration, the cut vertices are those nodes with more than one color: nodes 4, 6, and 7.