Using this algorithm, arbitrary two vertexes in a given undirected graph can achieve a required vertex-connected degree.

• 利用该算法可最优地将给定无向图中任意2点达到所要求的点连通度。