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

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

Author: pre-commit-ci[bot]

graphs/bidirectional_search.py

@@ -14,7 +14,12 @@
 from collections import deque
 
 
-def expand_search(graph: dict[int, list[int]], queue: deque[int], parents: dict[int, int | None], opposite_direction_parents: dict[int, int | None]) -> int | None:
+def expand_search(
+    graph: dict[int, list[int]],
+    queue: deque[int],
+    parents: dict[int, int | None],
+    opposite_direction_parents: dict[int, int | None],
+) -> int | None:
     if not queue:
         return None
 
@@ -98,13 +103,23 @@ def bidirectional_search(
     # Continue until both queues are empty or an intersection is found
     while forward_queue and backward_queue and intersection is None:
         # Expand forward search
-        intersection = expand_search(graph=graph, queue=forward_queue, parents=forward_parents, opposite_direction_parents=backward_parents)
+        intersection = expand_search(
+            graph=graph,
+            queue=forward_queue,
+            parents=forward_parents,
+            opposite_direction_parents=backward_parents,
+        )
 
         # If no intersection found, expand backward search
         if intersection is not None:
             break
 
-        intersection = expand_search(graph=graph, queue=backward_queue, parents=backward_parents, opposite_direction_parents=forward_parents)
+        intersection = expand_search(
+            graph=graph,
+            queue=backward_queue,
+            parents=backward_parents,
+            opposite_direction_parents=forward_parents,
+        )
 
     # If no intersection found, there's no path
     if intersection is None: