PAT 路径判断（并查集解法）

题目：

给定一个有N个顶点和E条边的无向图，请判断给定的两个顶点之间是否有路径存在。 假设顶点从0到N−1编号。

输入格式:

输入第1行给出2个整数N(0<N≤10)和E，分别是图的顶点数和边数。

随后E行，每行给出一条边的两个端点。每行中的数字之间用1空格分隔。

最后一行给出两个顶点编号i，j（0≤i,j<N）,i和j之间用空格分隔。

输出格式:

如果i和j之间存在路径，则输出"There is a path between i and j."，

否则输出"There is no path between i and j."。

输入样例1:

7 6
0 1
2 3
1 4
0 2
1 3
5 6
0 3

输出样例1:

There is a path between 0 and 3.

输入样例2:

7 6
0 1
2 3
1 4
0 2
1 3
5 6
0 6

输出样例2:

There is no path between 0 and 6.

代码：（套用并查集模板即可）

#include<bits/stdc++.h>
using namespace std;
const int maxn = 100;
int pre[maxn];

int find(int x)
{
	return pre[x] == x ? x : (pre[x] = find(pre[x]));
}

void join(int a, int b)
{
	int find1 = find(a);
	int find2 = find(b);
	if (find1 != find2)
		pre[find1] = find2;
}
int main()
{
	for (int i = 0; i < maxn; i++)
		pre[i] = i;
	int n, m;
	cin >> n >> m;
	for (int i = 0; i < m; ++i)
	{
		int a, b;
		cin >> a >> b;
		join(a, b);
	}
	int k1, k2;
	cin >> k1 >> k2;
	if (find(k1) == find(k2))
		printf("There is a path between %d and %d.", k1, k2);
	else
		printf("There is no path between %d and %d.", k1, k2);

	return 0;
}