union-find算法

public class UF { private int[] id; //份量id（以触点做为索引） private int count; //份量数量 public UF(int N) { //初始化份量数组 count = N; id = new int[N]; for (int i = 0; i < N; i++) id[i] = i; }

>>阅读原文<<