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

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

Author: pre-commit-ci[bot]

cellular_automata/conways_game_of_life.py

@@ -58,10 +58,8 @@ def new_generation(cells: list[list[int]]) -> list[list[int]]:
             # 3. All other live cells die in the next generation.
             #    Similarly, all other dead cells stay dead.
             alive = cells[i][j] == 1
-            if (
-                (alive and 2 <= neighbour_count <= 3)
-                or (not alive
-                and neighbour_count == 3)
+            if (alive and 2 <= neighbour_count <= 3) or (
+                not alive and neighbour_count == 3
             ):
                 next_generation_row.append(1)
             else:

ciphers/transposition_cipher.py

@@ -52,10 +52,8 @@ def decrypt_message(key: int, message: str) -> str:
         plain_text[col] += symbol
         col += 1
 
-        if (
-            (col == num_cols)
-            or ((col == num_cols - 1)
-            and (row >= num_rows - num_shaded_boxes))
+        if (col == num_cols) or (
+            (col == num_cols - 1) and (row >= num_rows - num_shaded_boxes)
         ):
             col = 0
             row += 1

data_structures/binary_tree/binary_tree_traversals.py

@@ -116,9 +116,7 @@ def level_order(root: Node | None) -> Generator[int]:
             process_queue.append(node.right)
 
 
-def get_nodes_from_left_to_right(
-    root: Node | None, level: int
-) -> Generator[int]:
+def get_nodes_from_left_to_right(root: Node | None, level: int) -> Generator[int]:
     """
     Returns a list of nodes value from a particular level:
     Left to right direction of the binary tree.
@@ -140,9 +138,7 @@ def populate_output(root: Node | None, level: int) -> Generator[int]:
     yield from populate_output(root, level)
 
 
-def get_nodes_from_right_to_left(
-    root: Node | None, level: int
-) -> Generator[int]:
+def get_nodes_from_right_to_left(root: Node | None, level: int) -> Generator[int]:
     """
     Returns a list of nodes value from a particular level:
     Right to left direction of the binary tree.

graphs/ant_colony_optimization_algorithms.py

@@ -195,9 +195,7 @@ def city_select(
     """
     probabilities = []
     for city, value in unvisited_cities.items():
-        city_distance = distance(
-            value, next(iter(current_city.values()))
-        )
+        city_distance = distance(value, next(iter(current_city.values())))
         probability = (pheromone[city][next(iter(current_city.keys()))] ** alpha) * (
             (1 / city_distance) ** beta
         )

physics/basic_orbital_capture.py

@@ -11,6 +11,7 @@
 
 This algorithm does not account for an N-body problem.
 """
+
 from math import pow, sqrt  # noqa: A004
 
 from scipy.constants import G, c, pi