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

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

Author: pre-commit-ci[bot]

graphs/tests/test_traveling_salesman_problem.py

@@ -18,14 +18,17 @@ def sample_graph_2() -> list[list[int]]:
         [20, 25, 30, 0],
     ]
 
+
 def test_brute_force() -> None:
     graph = sample_graph_1()
     assert tsp_brute_force(graph) == 64
 
+
 def test_dp() -> None:
     graph = sample_graph_1()
     assert tsp_dp(graph) == 64
 
+
 def test_greedy() -> None:
     graph = sample_graph_1()
     # The greedy algorithm does not guarantee an optimal solution;
@@ -35,6 +38,7 @@ def test_greedy() -> None:
     assert isinstance(result, int)
     assert result >= 64
 
+
 def test_dp_larger_graph() -> None:
     graph = sample_graph_2()
     assert tsp_dp(graph) == 80
@@ -44,6 +48,7 @@ def test_brute_force_larger_graph() -> None:
     graph = sample_graph_2()
     assert tsp_brute_force(graph) == 80
 
+
 def test_greedy_larger_graph() -> None:
     graph = sample_graph_2()
     result = tsp_greedy(graph)

graphs/traveling_salesman_problem.py

@@ -104,9 +104,13 @@ def tsp_greedy(graph: list[list[int]]) -> int:
     for _ in range(n - 1):
         # Find the nearest city to the current location that has not been visited.
         next_city = min(
-            ((city, cost) for city, cost in enumerate(graph[current]) if not visited[city] and city != current),
+            (
+                (city, cost)
+                for city, cost in enumerate(graph[current])
+                if not visited[city] and city != current
+            ),
             key=lambda cost: cost[1],
-            default=(None, float('inf'))
+            default=(None, float("inf")),
         )[0]
 
         # If no such city exists, break the loop.