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

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

Author: pre-commit-ci[bot]

dynamic_programming/travelling_salesman_problem.py

@@ -5,13 +5,13 @@
 
 def tsp(distances: list[list[int]]) -> int:
     """
-    Solves the Travelling Salesman Problem (TSP) using 
+    Solves the Travelling Salesman Problem (TSP) using
     dynamic programming and bitmasking.
     Args:
-        distances: 2D list where distances[i][j] is the 
+        distances: 2D list where distances[i][j] is the
         distance between city i and city j.
     Returns:
-        Minimum cost to complete the 
+        Minimum cost to complete the
         tour visiting all cities.
     Raises:
         ValueError: If any distance is negative.
@@ -20,7 +20,7 @@ def tsp(distances: list[list[int]]) -> int:
     80
     >>> tsp([[0, 29, 20, 21], [29, 0, 15, 17], [20, 15, 0, 28], [21, 17, 28, 0]])
     69
-    >>> tsp([[0, 10, -15, 20], [10, 0, 35, 25], [15, 35, 0, 30], [20, 25, 30, 0]])  
+    >>> tsp([[0, 10, -15, 20], [10, 0, 35, 25], [15, 35, 0, 30], [20, 25, 30, 0]])
     ValueError: Distance cannot be negative
     """
     n = len(distances)
@@ -35,7 +35,7 @@ def visit(city: int, mask: int) -> int:
         if mask == visited_all:
             return distances[city][0]  # Return to start
 
-        min_cost = float('inf')  # Large value to compare against
+        min_cost = float("inf")  # Large value to compare against
         for next_city in range(n):
             if not mask & (1 << next_city):  # If unvisited
                 new_cost = distances[city][next_city] + visit(
@@ -49,4 +49,5 @@ def visit(city: int, mask: int) -> int:
 
 if __name__ == "__main__":
     import doctest
+
     doctest.testmod()