Biconnected component

（重定向自Cut vertex）

In graph theory, a biconnected component (also known as a block or 2-connected component) is a maximal biconnected subgraph. Any connected graph decomposes into a tree of biconnected components called the block-cut tree of the graph. The blocks are attached to each other at shared vertices called cut vertices or articulation points. Specifically, a cut vertex is any vertex whose removal increases the number of connected components.

单词	Cut vertex
释义	Cut vertex 英语百科 Biconnected component （重定向自Cut vertex） In graph theory, a biconnected component (also known as a block or 2-connected component) is a maximal biconnected subgraph. Any connected graph decomposes into a tree of biconnected components called the block-cut tree of the graph. The blocks are attached to each other at shared vertices called cut vertices or articulation points. Specifically, a cut vertex is any vertex whose removal increases the number of connected components.
随便看	glack Glacken Glackens Glackens, William James glacon glacospore glactaric acid glactolipod glactonic acid glactosamine glactosylcerebrosidosis glactowaldenase glacturia glacé glacé icing glad assorted cake glad at Gladbach gladbach rheydt Gladbeck Gladbrook gladclothes GLADD gladden gladder