no

    public int find(int p) {
        if (p < 0 || p >= id.length) throw new IndexOutOfBoundsException();
        while (p != id[p]) {
            id[p] = id[id[p]];    // path compression by halving
            p = id[p];
        }
        return p;
    }

  public int find(int component) {
        // finds the root of the component group
        if (component < 0 || component >= components.length) throw new IndexOutOfBoundsException();
        if (components[component] != component) {
            return find(components[component]);
        } else {
            return component;
        }
    }