Created
August 13, 2021 16:10
-
-
Save GEEGABYTE1/80cc7bab311c8853fcdaca4950bd238d to your computer and use it in GitHub Desktop.
Traveling Salesman Algorithm
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
def visit_checker(graph): | |
for status in list(graph.values()): | |
if status == "unvisited": | |
return False | |
else: | |
continue | |
return True | |
def traveling_salesperson(graph): | |
graph = graph.graph_dict | |
final_path = "" | |
dictionary = {} | |
vertices = list(graph.keys()) | |
for i in vertices: | |
dictionary[i] = "unvisited" | |
current_vertex = random.choice(vertices) | |
dictionary[current_vertex] = "visited" | |
final_path += current_vertex | |
vertices_checker = visit_checker(dictionary) | |
if vertices_checker != True: | |
while vertices_checker == False: | |
unvisited_edges = graph[current_vertex].edges | |
next_vertex_checker = False | |
next_vertex = "" | |
while next_vertex_checker == False: | |
if len(list(unvisited_edges.keys())) == 0: | |
break | |
else: | |
# Minimum Edge | |
weights = list(unvisited_edges.values()) | |
min_weight = min(weights) | |
min_edge = None | |
for neighbour, weight in unvisited_edges.items(): | |
if weight == min_weight: | |
min_edge = neighbour | |
break | |
# Check if the min weight points to a vertex that has been not visited | |
min_edge_edges = list(graph[min_edge].edges.keys()) | |
for vertex in min_edge_edges: | |
if dictionary[vertex] == "unvisited": | |
next_vertex += vertex | |
next_vertex_checker = True | |
break | |
else: | |
continue | |
if next_vertex_checker == True: | |
break | |
else: | |
unvisited_edges.pop(min_edge) | |
if len(list(unvisited_edges.keys())) == 0: | |
vertices_checker = True | |
else: | |
current_vertex = next_vertex | |
dictionary[current_vertex] = 'visited' | |
final_path += " -> " + next_vertex | |
vertices_checker = visit_checker(dictionary) | |
print("Final Path: {}".format(final_path)) |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment