from tsp_solver.greedy import solve_tsp

f = open('data.txt','r')
D = list(map(lambda x: list(map(lambda s: int(s) ,x.split(','))),f.readlines()))

path = solve_tsp(D, optim_steps=9999)

print('path ')
print(path)

size = 0
for i in range(0, len(path) - 1):
  size += D[path[i]][path[i+1]]

print('size')
print(size)