ufsets.java

图论中关于简单无向图的深度

/**
 * <p>Title: </p>
 * <p>Description: </p>
 * <p>Copyright: Copyright (c) 2005</p>
 * <p>Company: </p>
 * @author not attributable
 * @version 1.0
 */

public class UFSets {
  int[] parent;
    int size;
    /** Creates a new instance of UFSets */
    public UFSets(int s) {
        size=s;
        parent=new int[size];
        for(int i=0;i<size;i++)parent[i]=-1;
    }

    public int Find(int x){
        if(parent[x]<0)return x;
        else return Find(parent[x]);
    }

    public void print(){
        for(int i=0;i<7;i++)
            System.out.println(parent[i]+" ");
    }

    public void Union(int Root1,int Root2){
        if(parent[Root2]==-1)
            parent[Root2]=Root1;
        else{
            Union(Root1,Find(Root2));
        }
    }

    /**
     * @param args the command line arguments
     */
/*    public static void main(String[] args) {
        UFSets set=new UFSets(7);
        set.Union(0,5);
        set.Union(1,6);
        set.Union(1,2);
        set.Union(2,3);
        set.Union(3,4);
        set.Union(4,5);
        for(int i=0;i<7;i++)
            System.out.println(""+set.Find(i));
        set.print();
    } */
}