思路
给每个触点一个权重,使得总是让小数加到大树上
public class UF2 {
private int[] id;
private int[] sz;
private int count;
public UF2 (int N) {
id = new int[N];
sz = new int[N];
this.count = N;
for(int i=0;i<count;i++) {
id[i] = i;
sz[i] = 1;
}
}
代码实现
package Mr_math;
import java.util.Random;
public class UF2 {
private int[] id;
private int[] sz;
private int count;
public UF2 (int N) {
id = new int[N];
sz = new int[N];
this.count = N;
for(int i=0;i<count;i++) {
id[i] = i;
sz[i] = 1;
}
}
public int count() {
return this.count;
}
public int find(int number) {
while(number != id[number]) number = id[number];
return number;
}
public void union(int p, int q) {
int i = find(p);
int j= find(q);
if(i == j) return;
if(sz[i]>sz[j]) {
id[j] = i;
sz[i]+= sz[j];
}
else {
id[i] = j;
sz[j] += sz[i];
}
count--;
}
public void see() {
System.out.println("矩阵情况:");
for(int i=0;i<10;i++) {
System.out.print(i+" ");
}
System.out.println();
for(int i=0;i<id.length;i++) {
System.out.print(sz[i]+" ");
}
System.out.println();
for(int i=0;i<id.length;i++) {
System.out.print(id[i]+" ");
}
}
public static void main(String []args) {
//Scanner out = new Scanner(System.in); System.out.print("输入:");
Random out = new Random();
int p;
int q;
int N= 10;
UF2 uf =new UF2(N);
int count=0;
while(uf.count != N-9) {
p = out.nextInt(10);
q = out.nextInt(10);
uf.union(p, q);
if(count !=uf.count) { //归并后,count--,每次状态发生变化,打印在控制台
System.out.println();
System.out.println("p="+p+" , q="+q);
System.out.println("count:"+uf.count());
uf.see();
count = uf.count;
}
}
}
}