[pre-commit.ci] auto fixes from pre-commit.com hooks

for more information, see https://pre-commit.ci

Author: pre-commit-ci[bot]

graphs/edmonds_karp_multiple_source_and_sink.py

@@ -7,7 +7,9 @@
 
 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.
 
@@ -61,7 +63,9 @@ def maximum_matching(edges: List[Tuple[int, int]], vertex_count: int) -> List[Tu
                             if match[neighbor] == UNMATCHED:
                                 parent[neighbor] = current_vertex
                                 augmenting_path_found = True
-                                EdmondsBlossomAlgorithm.update_matching(match, parent, neighbor)
+                                EdmondsBlossomAlgorithm.update_matching(
+                                    match, parent, neighbor
+                                )
                                 break
 
                             # Case 2: neighbor is matched, add neighbor's match to the queue
@@ -73,12 +77,25 @@ def maximum_matching(edges: List[Tuple[int, int]], vertex_count: int) -> List[Tu
                                 in_queue[matched_vertex] = True
                         else:
                             # Case 3: Both current_vertex and neighbor have a parent; check for a cycle/blossom
-                            base_vertex = EdmondsBlossomAlgorithm.find_base(base, parent, current_vertex, neighbor)
+                            base_vertex = EdmondsBlossomAlgorithm.find_base(
+                                base, parent, current_vertex, neighbor
+                            )
                             if base_vertex != UNMATCHED:
-                                EdmondsBlossomAlgorithm.contract_blossom(BlossomData(
-                                    BlossomAuxData(queue, parent, base, in_blossom, match, in_queue),
-                                    current_vertex, neighbor, base_vertex
-                                ))
+                                EdmondsBlossomAlgorithm.contract_blossom(
+                                    BlossomData(
+                                        BlossomAuxData(
+                                            queue,
+                                            parent,
+                                            base,
+                                            in_blossom,
+                                            match,
+                                            in_queue,
+                                        ),
+                                        current_vertex,
+                                        neighbor,
+                                        base_vertex,
+                                    )
+                                )
 
         # Create result list of matched pairs
         matching_result = []
@@ -89,7 +106,9 @@ def maximum_matching(edges: List[Tuple[int, int]], vertex_count: int) -> List[Tu
         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.
 
@@ -111,7 +130,9 @@ def update_matching(match: List[int], parent: List[int], current_vertex: int) ->
             current_vertex = next_vertex
 
     @staticmethod
-    def find_base(base: List[int], parent: List[int], vertex_u: int, vertex_v: int) -> int:
+    def find_base(
+        base: List[int], parent: List[int], vertex_u: int, vertex_v: int
+    ) -> int:
         """
         Finds the base of a node in the blossom.
 
@@ -146,7 +167,7 @@ def find_base(base: List[int], parent: List[int], vertex_u: int, vertex_v: int)
             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.
@@ -162,18 +183,26 @@ 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[blossom_data.aux_data.match[current_vertex_u]]
+            current_vertex_u = blossom_data.aux_data.parent[
+                blossom_data.aux_data.match[current_vertex_u]
+            ]
 
         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[blossom_data.aux_data.match[current_vertex_v]]
+            current_vertex_v = blossom_data.aux_data.parent[
+                blossom_data.aux_data.match[current_vertex_v]
+            ]
 
         # Update the base for all marked vertices
         for i in range(len(blossom_data.aux_data.base)):
@@ -189,8 +218,15 @@ class BlossomAuxData:
     Auxiliary data class to encapsulate common parameters for the blossom operations.
     """
 
-    def __init__(self, queue: deque, parent: List[int], base: List[int],
-                 in_blossom: List[bool], match: List[int], in_queue: List[bool]) -> None:
+    def __init__(
+        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
         self.base = base