Class Dus

Java/graph_connectivity_with_threshold.java:10–37

*/
class Solution {
    public static class Dus {
        int[] parent;
        int n;

        Dus(int n) {
            this.n = n;
            parent = new int[n];
            for (int i = 1; i < n; i++) {
                parent[i] = i;
            }
        }

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

        public void union(int u, int v) {
            int pu = find(u);
            int pv = find(v);

            if (pu != pv) {
                parent[pv] = pu;
            }
        }
    }
    public List<Boolean> areConnected(int n, int threshold, int[][] queries) {
        ArrayList<Boolean> res = new ArrayList<>();
        Dus dus = new Dus(n+1);