2685. Count the Number of Complete Components

You are given an integer n. There is an undirected graph with n vertices, numbered from 0 to n - 1. You are given a 2D integer array edges where edges[i] = [ai, bi] denotes that there exists an undirected edge connecting vertices ai and bi.

Return the number of complete connected components of the graph.

A connected component is a subgraph of a graph in which there exists a path between any two vertices, and no vertex of the subgraph shares an edge with a vertex outside of the subgraph.

A connected component is said to be complete if there exists an edge between every pair of its vertices.

class Solution {
    int uf[101];
    int find(int u) {
        return uf[u] == u ? u : uf[u] = find(uf[u]);
    }
    void uni(int u, int v) {
        int pu = find(u), pv = find(v);
        uf[pu ] = uf[pv] = min(pu,pv);
    }
public:
    int countCompleteComponents(int n, vector<vector<int>>& edges) {
        for(int i = 0; i < n; i++) uf[i] = i;
        unordered_set<int> adj[n];
        for(auto e : edges) {
            int u = e[0], v = e[1];
            uni(u,v);
            adj[u].insert(v);
            adj[v].insert(u);
        }
        unordered_map<int, vector<int>> g;
        for(int i = 0; i < n; i++) {
            g[find(i)].push_back(i);
        }
        int res = 0;
        for(auto [k, vec] : g) {
            bool ok = true;
            for(int i = 0; i < vec.size() and ok; i++) {
                for(int j = i + 1; j < vec.size() and ok; j++) {
                    if(!adj[vec[i]].count(vec[j])) ok = false;
                }
            }
            res += ok;
        }
        return res;
    }
};