并查集，判断图中的两个点是否之间是否又路径

#include<iostream>
using namespace std;
//n-节点数
//m-边的数
//p-测试数
//给一幅图，判断两个点之间是否存在路径

int root[10001], n, m, p;
int find(int x) {
    if (x == root[x])return x;
    root[x] = find(root[x]);
    return root[x];
}
int main() {
    cin >> n >> m >> p;
    for (int i = 1; i <= n; ++i) {
        root[i] = i;
    }
    for (int i = 1; i <= m; ++i) {
        int x, y;
        cin >> x >> y;
        if (find(x) != find(y))
            root[find(x)] = find(y);
    }
    for (int i = 1; i <= p; i++) {
        int x, y;
        cin >> x >> y;
        if (root[find(x)] == root[find(y)])
            cout << "YES" << endl;
        else
            cout << "NO" << endl;
    }
    return 0;
}