algorithm analysis 开坑1

做好一件事要善始善终

Union-find data type(API)

public class UFUF(int N)void union(int p,int q)  // add connection between p and qboolean connected(int p,int q)int find(int p)int count() 

public static void main(String[] args){    // to input two numbers    int N =StdIn.readInt();    UF uf=new UF(N);    while(!StdIn.isEmpty()){    // to read int number    int p=StdIn.readInt();    int q=StdIn.readInt();    // if haven't connected    if(!uf.connected(p,q)){        // connect q and q          uf.union(p,q);        StdOut.println(p+" "+q);            }    }}