Skip to content

Instantly share code, notes, and snippets.

@gtke

gtke/Quick Find Algorithm

Created September 2, 2012 21:57
Download ZIP

Revisions

  1. @gtkesh gtkesh created this gist Sep 2, 2012.
    24 changes: 24 additions & 0 deletions Quick Find Algorithm
    View file
    Original file line number Diff line number Diff line change
    @@ -0,0 +1,24 @@
    public class quickFind {

    private int [] id;

    public void QuickFindUF (int N){
    id = new int [N];
    for(int i = 0; i< N; i++){
    id[i]=i;
    }
    }
    public boolean connected(int p, int q){
    return id[p] == id[q];
    }

    public void union(int p, int q){
    int pid = id[p];
    int qid = id[q];
    for(int i =0; i<id.length; i++){
    if(id[i] == pid){
    id[i] = qid;
    }
    }
    }
    }