POJ 1523 浅谈无向图TarJan连通块割顶分割技术

世界真的很大
昨天晚上还有十分钟的时候开始写这道题，未果
今天上午考试下午讲课晚上好不容易有时间来写这道题，成功
犯了一个小小的错误不必深究
POJ的读入方式怎么这么恶心woc。。

看题先：

description：

无向图求割点和去除割点后连通分量的个数

input：

The input will contain the description of several networks. A network description will consist of pairs of integers, one pair per line, that identify connected nodes. Ordering of the pairs is irrelevant; 1 2 and 2 1 specify the same connection. All node numbers will range from 1 to 1000. A line containing a single zero ends the list of connected nodes. An empty network description flags the end of the input. Blank lines in the input file should be ignored.

output：

For each network in the input, you will output its number in the file, followed by a list of any SPF nodes that exist.

The first network in the file should be identified as “Network #1”, the second as “Network #2”, etc. For each SPF node, output a line, formatted as shown in the examples below, that identifies the node and the number of fully connec