void Make_Set() {
for (int i = 0; i <= numberOfVillages + 1; i++) {
set[i] = i;
rank_[i] = 0;
}
}
int Find_Set(int i){
if (set[i] == i)
return set[i];
return Find_Set(set[i]);
}
bool Union(int i, int j){
i = Find_Set(i);
j = Find_Set(j);
if (i == j) return false;
if (rank_[i]>rank_[j]) set[j] = i;
else
{
if (rank_[i] == rank_[j]) rank_[j]++;
set[i] = j;
}
return true;
}
求dalao们帮我看看这段代码大概的逻辑,有点看懵了