diff --git a/graphs/edmonds_blossom_algorithm.py b/graphs/edmonds_blossom_algorithm.py
index aa5ce8c70..6e51defbe 100644
--- a/graphs/edmonds_blossom_algorithm.py
+++ b/graphs/edmonds_blossom_algorithm.py
@@ -241,8 +241,9 @@ class BlossomData:
     BlossomData class with reduced parameters.
     """
 
-    def __init__(self, aux_data: BlossomAuxData, vertex_u: int,
-                 vertex_v: int, lca: int) -> None:
+    def __init__(
+        self, aux_data: BlossomAuxData, vertex_u: int, vertex_v: int, lca: int
+    ) -> None:
         """
         Initialize BlossomData with auxiliary data, two vertices,
         and the lowest common ancestor.
@@ -256,4 +257,3 @@ class BlossomData:
         self.vertex_u = vertex_u
         self.vertex_v = vertex_v
         self.lca = lca
-
diff --git a/graphs/tests/test_edmonds_blossom_algorithm.py b/graphs/tests/test_edmonds_blossom_algorithm.py
index 661533d21..0c44f5bf2 100644
--- a/graphs/tests/test_edmonds_blossom_algorithm.py
+++ b/graphs/tests/test_edmonds_blossom_algorithm.py
@@ -10,7 +10,6 @@ from graphs.edmonds_blossom_algorithm import (
 
 
 class TestEdmondsBlossomAlgorithm(unittest.TestCase):
-
     def test_maximum_matching(self):
         # Test case: Basic matching in a simple graph
         edges = [(0, 1), (1, 2), (2, 3)]
@@ -68,5 +67,5 @@ class TestEdmondsBlossomAlgorithm(unittest.TestCase):
         assert aux_data.in_queue[1]
 
 
-if __name__ == '__main__':
+if __name__ == "__main__":
     unittest.main()