union find

Author: iAshishChauhan

Union FInd/Java/QuickFindUF.java

@@ -0,0 +1,23 @@
+import java.util.*;
+public class QuickFindUF
+{
+	private int id[];
+	public QuickFindUF(int N)
+	{
+		id=new int[N];
+	}
+	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;
+		}
+	}
+}

Union FInd/Java/QuickUnionUF.java

@@ -0,0 +1,34 @@
+public class QuickUnionUF
+{
+	private int[] id;
+	
+	public QuickUnionUF(int n)
+	{
+		id = new int[N];
+		for(int i=0;i<n;i++)
+		{
+			id[i]=i;
+		}
+	}
+	
+	private int root(int i)
+	{
+		while(i != id[i])
+		{
+			i=id[i];
+		}
+		return i;
+	}
+	
+	public boolean connected(int p,int q)
+	{
+		return root(p)==root(q);
+	}
+	
+	public void union(int p,int q)
+	{
+		int i = root(p);
+		int j = root(q);
+		id[i] = j;
+	}
+}