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

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

Author: pre-commit-ci[bot]

networking_flow/ford_fulkerson.py

@@ -19,9 +19,7 @@
 ]
 
 
-def breadth_first_search(
-    graph: list, source: int, sink: int, parents: list
-) -> bool:
+def breadth_first_search(graph: list, source: int, sink: int, parents: list) -> bool:
     """
     This function returns True if there is a node that has not iterated.
 
@@ -99,7 +97,7 @@ def ford_fulkerson(graph: list, source: int, sink: int) -> int:
     # Augment the flow while there is a path from source to sink
     while breadth_first_search(residual_graph, source, sink, parents):
         # Find the minimum residual capacity along the path
-        path_flow = float('inf')
+        path_flow = float("inf")
         current_node = sink
 
         # Find the minimum capacity in the path
@@ -126,4 +124,4 @@ def ford_fulkerson(graph: list, source: int, sink: int) -> int:
     from doctest import testmod
 
     testmod()
-    print(f"{ford_fulkerson(graph, source=0, sink=5) = }")
+    print(f"{ford_fulkerson(graph, source=0, sink=5) = }")