[閒聊] Biconnected Components
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.
--
我老婆1 http://i.imgur.com/qcvvvGh.png
--
※ 發信站: 批踢踢實業坊(ptt.cc), 來自: 140.113.68.213
※ 文章網址: https://www.ptt.cc/bbs/Marginalman/M.1483896295.A.827.html
推
01/09 01:41, , 1F
01/09 01:41, 1F
討論串 (同標題文章)
以下文章回應了本文 (最舊先)：
完整討論串 (本文為第 1 之 10 篇)：