Algorithms.QuickFindUF.Union C# (CSharp) Метод

        public void Union(int p, int q) {
            if (Connected(p, q)) {
                return;
            }
            int pid = id[p];
            for (int i = 0; i < id.Length; i++) {
                if (id[i] == pid) {
                    id[i] = id[q];
                }
            }
            count--;
        }
    }