Update 08 Kruskal's MST.cpp

Author: zarif98sjs

Algorithm/08 Kruskal's MST.cpp

@@ -102,7 +102,7 @@ class DisjointSet
 		if (parent[k] == k)
 			return k;
 
-		return Find(parent[k]);
+		return parent[k] =Find(parent[k]);
 	}
 
 	void Union(int a, int b)