s434720/2019SZI-Projekt
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

path optimalisation

Browse Source
This commit is contained in:
Maciej Sobkowiak 2019-06-10 02:29:08 +02:00
parent f8864d2ecd
commit 0a465f0dd8
1 changed files with 1 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

3
UI/window.py
View File

@ -74,13 +74,12 @@ class Window():
for upoint in to_collect: for upoint in to_collect:
if upoint in visited : if upoint in visited :
path_distances.append(100000) path_distances.append(100000)
elif dist(s,upoint) > dist(end,upoint): elif dist(s,upoint) >= dist(end,upoint):
path_distances.append(50000) path_distances.append(50000)
else: else:
path_distances.append(dist(s,upoint)) path_distances.append(dist(s,upoint))
min_index = np.argmin(path_distances) min_index = np.argmin(path_distances)
visited.append(to_collect[min_index]) visited.append(to_collect[min_index])
print(to_collect,"\n",path_distances,"\n",min_index,"\n",to_collect[min_index])
to_collect_sorted.append(to_collect[min_index]) to_collect_sorted.append(to_collect[min_index])