Update minimum_spanning_tree_kruskal2.py

Author: lighting9999

graphs/minimum_spanning_tree_kruskal2.py

@@ -1,19 +1,14 @@
 from __future__ import annotations
 
-from typing import Generic, TypeVar
-
-T = TypeVar("T")
-
-
-class DisjointSetTreeNode(Generic[T]):
+class DisjointSetTreeNode[T]:
     # Disjoint Set Node to store the parent and rank
     def __init__(self, data: T) -> None:
         self.data = data
         self.parent = self
         self.rank = 0
 
 
-class DisjointSetTree(Generic[T]):
+class DisjointSetTree[T]:
     # Disjoint Set DataStructure
     def __init__(self) -> None:
         # map from node name to the node object
@@ -46,7 +41,7 @@ def union(self, data1: T, data2: T) -> None:
         self.link(self.find_set(data1), self.find_set(data2))
 
 
-class GraphUndirectedWeighted(Generic[T]):
+class GraphUndirectedWeighted[T]:
     def __init__(self) -> None:
         # connections: map from the node to the neighbouring nodes (with weights)
         self.connections: dict[T, dict[T, int]] = {}
@@ -118,4 +113,5 @@ def kruskal(self) -> GraphUndirectedWeighted[T]:
                 num_edges += 1
                 graph.add_edge(u, v, w)
                 disjoint_set.union(u, v)
+        # Return the generated Minimum Spanning Tree
         return graph