Corrected ruff checks

Author: TarunVishwakarma1

graphs/edmonds_blossom_algorithm.py

@@ -1,15 +1,11 @@
 from collections import deque, defaultdict
-from typing import List, Tuple, Dict
-
 
 UNMATCHED = -1  # Constant to represent unmatched vertices
 
 
 class EdmondsBlossomAlgorithm:
     @staticmethod
-    def maximum_matching(
-        edges: List[Tuple[int, int]], vertex_count: int
-    ) -> List[Tuple[int, int]]:
+    def maximum_matching(edges: list[tuple[int, int]], vertex_count: int) -> list[tuple[int, int]]:
         """
         Finds the maximum matching in a general graph using Edmonds' Blossom Algorithm.
 
@@ -20,7 +16,7 @@ def maximum_matching(
         >>> EdmondsBlossomAlgorithm.maximum_matching([(0, 1), (1, 2), (2, 3)], 4)
         [(0, 1), (2, 3)]
         """
-        graph: Dict[int, List[int]] = defaultdict(list)
+        graph: dict[int, list[int]] = defaultdict(list)
 
         # Populate the graph with the edges
         for vertex_u, vertex_v in edges:
@@ -84,16 +80,10 @@ def maximum_matching(
                                 EdmondsBlossomAlgorithm.contract_blossom(
                                     BlossomData(
                                         BlossomAuxData(
-                                            queue,
-                                            parent,
-                                            base,
-                                            in_blossom,
-                                            match,
-                                            in_queue,
+                                            queue, parent, base, in_blossom,
+                                            match, in_queue
                                         ),
-                                        current_vertex,
-                                        neighbor,
-                                        base_vertex,
+                                        current_vertex, neighbor, base_vertex
                                     )
                                 )
 
@@ -106,9 +96,7 @@ def maximum_matching(
         return matching_result
 
     @staticmethod
-    def update_matching(
-        match: List[int], parent: List[int], current_vertex: int
-    ) -> None:
+    def update_matching(match: list[int], parent: list[int], current_vertex: int) -> None:
         """
         Updates the matching along the augmenting path found.
 
@@ -131,7 +119,7 @@ def update_matching(
 
     @staticmethod
     def find_base(
-        base: List[int], parent: List[int], vertex_u: int, vertex_v: int
+        base: list[int], parent: list[int], vertex_u: int, vertex_v: int
     ) -> int:
         """
         Finds the base of a node in the blossom.
@@ -167,7 +155,7 @@ def find_base(
             current_vertex_v = parent[current_vertex_v]
 
     @staticmethod
-    def contract_blossom(blossom_data: "BlossomData") -> None:
+    def contract_blossom(blossom_data: 'BlossomData') -> None:
         """
         Contracts a blossom in the graph, modifying the base array
         and marking the vertices involved.
@@ -183,9 +171,7 @@ def contract_blossom(blossom_data: "BlossomData") -> None:
         current_vertex_u = blossom_data.u
         while blossom_data.aux_data.base[current_vertex_u] != blossom_data.lca:
             base_u = blossom_data.aux_data.base[current_vertex_u]
-            match_base_u = blossom_data.aux_data.base[
-                blossom_data.aux_data.match[current_vertex_u]
-            ]
+            match_base_u = blossom_data.aux_data.base[blossom_data.aux_data.match[current_vertex_u]]
             blossom_data.aux_data.in_blossom[base_u] = True
             blossom_data.aux_data.in_blossom[match_base_u] = True
             current_vertex_u = blossom_data.aux_data.parent[
@@ -195,9 +181,7 @@ def contract_blossom(blossom_data: "BlossomData") -> None:
         current_vertex_v = blossom_data.v
         while blossom_data.aux_data.base[current_vertex_v] != blossom_data.lca:
             base_v = blossom_data.aux_data.base[current_vertex_v]
-            match_base_v = blossom_data.aux_data.base[
-                blossom_data.aux_data.match[current_vertex_v]
-            ]
+            match_base_v = blossom_data.aux_data.base[blossom_data.aux_data.match[current_vertex_v]]
             blossom_data.aux_data.in_blossom[base_v] = True
             blossom_data.aux_data.in_blossom[match_base_v] = True
             current_vertex_v = blossom_data.aux_data.parent[
@@ -219,13 +203,8 @@ class BlossomAuxData:
     """
 
     def __init__(
-        self,
-        queue: deque,
-        parent: List[int],
-        base: List[int],
-        in_blossom: List[bool],
-        match: List[int],
-        in_queue: List[bool],
+        self, queue: deque, parent: list[int], base: list[int], in_blossom: list[bool],
+        match: list[int], in_queue: list[bool]
     ) -> None:
         self.queue = queue
         self.parent = parent