Remove unused rank list in Kruskal solution exam_06

Author: TeogopK

Exams/exam_06/task1/solution_kruskal.py

@@ -10,7 +10,7 @@ def find(x, parents):
 
     return furthest_parent
 
-def union(x, y, parents, rank):
+def union(x, y, parents):
     x_root = find(x, parents)
     y_root = find(y, parents)
 
@@ -23,17 +23,15 @@ def union(x, y, parents, rank):
 queries = (tuple(map(int, input().split())) for _ in range(Q))
 
 def solve(V, edges, queries):
-    rank = [0] * (V + 1)
     parents = [v for v in range(V + 1)]
 
     for x, y in edges:
-        union(x, y, parents, rank)
+        union(x, y, parents)
 
     for x, y in queries:
         is_connected = find(x, parents) == find(y, parents)
 
         print(1 if is_connected else 0, end = ' ')
 
 
-solve(N, edges, queries)
-
+solve(N, edges, queries)