文件名称:Tarjan
介绍说明－－下载内容均来自于网络，请自行研究使用
求无向图最少加多少条边才能变成双联通图，输入顶点数和变数，然后读入图，利用无向图的Tarjan算法。-At least they try to figure how much to become a double edge Unicom plans, and variable input vertices, and then read into the figure, the use of undirected Tarjan algorithm.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
Tarjan.cpp