Update travelling_salesman_problem.py

Author: OmMahajan29

dynamic_programming/travelling_salesman_problem.py

@@ -13,18 +13,6 @@ def tsp(distances: list[list[int]]) -> int:
         tour visiting all cities.
     Raises:
         ValueError: If any distance is negative.
-
-    >>> tsp([[0, 10, 15, 20], [10, 0, 35, 25], [15, 35, 0, 30],
-    [20, 25, 30, 0]])
-    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]])  # doctest: +ELLIPSIS
-    Traceback (most recent call last):
-        ...
-    ValueError: Distance cannot be negative
     """
     n = len(distances)
     if any(distances[i][j] < 0 for i in range(n) for j in range(n)):
@@ -54,5 +42,4 @@ def visit(city: int, mask: int) -> int:
 
 if __name__ == "__main__":
     import doctest
-
     doctest.testmod()