Number of Connected Components in an Undirected Graph

public class Solution {
    private int[] parent;
    public int countComponents(int n, int[][] edges) {
        if (edges.length == 0) {
            return n;
        }
        parent = new int[n];
        for (int i = 0; i < n; i++) {
            parent[i] = i;
        }
        
        for (int i = 0; i < edges.length; i++) {
            int aIndex = findParent(edges[i][0]);
            int bIndex = findParent(edges[i][1]);
            
            if (aIndex > bIndex) {
                parent[aIndex] = bIndex;
            } else if (bIndex > aIndex) {
                parent[bIndex] = aIndex;
            }
        }
        
        int result = 0;
        for (int i = 0; i < n; i++) {
            if (parent[i] == i) {
                result++;
            }
        } 
        return result;
    }
    
    private int findParent(int x) {
        while (x != parent[x]) {
            parent[x] = parent[parent[x]];
            x = parent[x];
        }
        return x;
    }
}