path optimalisation
This commit is contained in:
parent
f8864d2ecd
commit
0a465f0dd8
@ -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])
|
||||||
|
|
||||||
|
|
||||||
|
Loading…
Reference in New Issue
Block a user