start_path=overall_best_path,
iterations=15,
on_iteration_completed=on_iteration_completed)
plt.show()
on_iteration_completed(best_path, best_distance)
overall_best_path_len = len(overall_best_path)
if overall_best_path_len == len(graph.nodes):
overall_best_path.append(0)
break
overall_best_path.append(best_path[overall_best_path_len])
traveled_distance = aco.get_distance_in_path(overall_best_path)
print("Melhor caminho no geral:", overall_best_path)
print("Melhor distância no geral:", traveled_distance)
for node in graph.nodes:
if node.id == best_path[overall_best_path_len]:
print("Próxima unidade de saúde em:", node.name)
break
graph.reroll_costs()
input("Ir para próximo nó...\n")
print("Melhor caminho no geral:", overall_best_path)
print("Melhor distância no geral:", traveled_distance)
plt.show()
on_iteration_completed(best_path, best_distance)
