有C＋＋代码吗

当然可以，以下是使用C++的代码实现：

#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>

using namespace std;

class UnionFind {
public:
    UnionFind(int n) {
        parent.resize(n);
        size.resize(n, 1);
        for (int i = 0; i < n; ++i) {
            parent[i] = i;
        }
    }

    int find(int i) {
        if (parent[i] != i) {
            parent[i] = find(parent[i]);
        }
        return parent[i];
    }

    void unite(int i, int j) {
        int pi = find(i), pj = find(j);
        if (pi != pj) {
            if (size[pi] < size[pj]) {
                swap(pi, pj);
            }
            parent[pj] = pi;
            size[pi] += size[pj];
        }
    }

private:
    vector<int> parent, size;
};

pair<int, vector<int>> cluster(const vector<pair<double, double>>& points, double d) {
    int n = points.size();
    UnionFind uf(n);
    vector<tuple<int, int, double>> edges;
    for (int i = 0; i < n; ++i) {
        for (int j = i+1; j < n; ++j) {
            double dist = sqrt(pow(points[i].first-points[j].first, 2) + pow(points[i].second-points[j].second, 2));
            if (dist < d) {
                edges.emplace_back(i, j, dist);
            }
        }
    }

    sort(edges.begin(), edges.end(), [](auto& a, auto& b) {
        return get<2>(a) < get<2>(b);
    });

    for (auto& [i, j, dist] : edges) {
        if (uf.find(i) != uf.find(j)) {
            uf.unite(i, j);
        }
    }

    int count = 0;
    vector<int> sizes;
    vector<bool> visited(n, false);
    for (int i = 0; i < n; ++i) {
        if (!visited[i]) {
            ++count;
            int root = uf.find(i);
            int size = uf.size[root];
            visited[root] = true;
            for (int j = 0; j < n; ++j) {
                if (uf.find(j) == root) {
                    visited[j] = true;
                }
            }
            sizes.push_back(size);
        }
    }

    return {count, sizes};
}

int main() {
    vector<pair<double, double>> points{{0,0}, {1,1}, {2,2}, {3,3}, {4,4}, {5,5}, {6,6}, {7,7}, {8,8}, {9,9}};
    double d = 1.5;
    auto [count, sizes] = cluster(points, d);
    cout << "cluster count: " << count << endl;
    cout << "cluster sizes: ";
    for (auto size : sizes) {
        cout << size << " ";
    }
    cout << endl;
    return 0;
}

其中，`points`是一个包含所有点坐标的vector，`d`是距离阈值。函数`cluster`返回团簇的个数和每个团簇中点的个数。