IN4050/in4050-oblig1
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Update docstring

Browse Source
This commit is contained in:
Cory Balaton 2024-10-01 19:18:25 +02:00
parent 375e2066b4
commit 667c19ecc3
Signed by: coryab
GPG Key ID: F7562F0EC4E4A61B
1 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
exhaustive_search.py
View File

@ -20,8 +20,8 @@ def exhaustive_search(distances: npt.NDArray) -> Tuple[float, npt.NDArray]:
distances (npt.NDArray): An array containing distances to travel. distances (npt.NDArray): An array containing distances to travel.
Returns: Returns:
A tuple containing the shortest travel distance and its corresponding Tuple[float, npt.NDArray] A tuple containing the shortest travel
permutation. distance and its corresponding permutation.
""" """
size = len(distances) size = len(distances)
@ -30,7 +30,7 @@ def exhaustive_search(distances: npt.NDArray) -> Tuple[float, npt.NDArray]:
map( # Map the permutation array to contain tuples (distance, permutation) map( # Map the permutation array to contain tuples (distance, permutation)
lambda perm: ( lambda perm: (
sum([distances[perm[i - 1], perm[i]] for i in range(size)]), sum([distances[perm[i - 1], perm[i]] for i in range(size)]),
np.array(perm) np.array(perm),
), ),
permutations(range(size)), permutations(range(size)),
), ),