Method DSU

CountTheNumberOfCompleteComponents.java:32–39

(int n)

        int[] size;

        DSU(int n) {
            parent = new int[n];
            size = new int[n];
            for(int i=0;i<n;i++){
                parent[i] = i;
            }
            Arrays.fill(size, 1);
        }

        // Find root of component with path compression
        int find(int node) {