【算法概论】图论算法：无向图中的双连通分量划分问题

问题描述：

       给定一个无向图，设计一个算法，判断该图中是否存在关节点，并划分双连通分量。

❗算法描述❗：

       先明确几个概念：

       Let G be a connected graph:

       A separation vertex (articulation) 关节点 of G is a vertex whose removal disconnects G.

       A separation edge (bridge) of G is an edge whose removal disconnects G.

       Biconnected Graph: no edge and no bridge; for any u and v of G, there is a simple cycle containing u and v.

       Biconnected component(简写为Bicomponent): a maximal biconnect