feature1.0.1 : just touch - no big change

@@ -6,7 +6,7 @@ rank = dict()
 
 def make_singleton_set(v) :
     parent[v] = v
-    rank[v] = 1
+    rank[v] = 0
 
 def find(v) :
     if(parent[v] != v) :
@@ -17,11 +17,10 @@ def union(r1, r2) :
     if(r1 != r2) :
         if(rank[r1] > rank[r2]) :
             parent[r2] = r1
-            rank[r1] += rank[r2]
         else :
             parent[r1] = r2
             if(rank[r1] == rank[r2]) :
-                rank[r2] += rank[r1]
+                rank[r2] += 1
 
 def Kruskal(graph) :
     #n =  정점의 수 / m = 엣지의 수
@@ -39,7 +38,7 @@ def Kruskal(graph) :
     F = set()
 
     index = 0
-    while len(F) < n - 1 :
+    while len(F) <= n - 1 :
         e = edge_list[index]
 
         p = find(e[1])