题目来源:http://poj.org/problem?id=1737
Connected Graph
Time Limit: 1000MS |
Memory Limit: 30000K |
Total Submissions: 3573 |
Accepted: 1727 |
Description
An undirected graph is a set V of vertices and aset of E∈{V*V} edges.An undirected graph is connected ifand only if for every pair (u,v) of vertices,u is reachable from v.
You are to write a program that tries to calculate the n