[{"sectionTitle":"题目描述","type":"Text","text":"原题来自：CTU Open 2004\r\n\r\n求一个无向图图删除一个点之后，连通块最多有多少。","subType":"markdown"},{"sectionTitle":"输入格式","type":"Text","text":"多组数据。第一行两个整数 $P,C$ 表示点数和边数。 \r\n接下来 $C$ 行每行两个整数 $p1,p2$，表示 $p1$ 与 $p2$ 有边连接，保证无重边。读入以 0 0 结束。","subType":"markdown"},{"sectionTitle":"输出格式","type":"Text","text":"输出若干行，表示每组数据的结果。","subType":"markdown"},{"sectionTitle":"样例","type":"Sample","text":"","subType":"markdown","payload":["3 3\n0 1\n0 2\n2 1\n4 2\n0 1\n2 3\n3 1\n1 0\n0 0","1\n2\n2"]},{"sectionTitle":"数据范围与提示","type":"Text","text":"$1 \\le P \\le 10000,C \\ge 0,0 \\le p1, p2 < P$","subType":"markdown"}]