tsp-solver
tsp-solver copied to clipboard
Python implementation of Travelling Salesman Problem (TSP) using branch-and-bound algorithm.
TSP Branch and Bound
Traveling Sales Person, using branch and bound.
In this python implementation, def travel(@params) finds a solution to TSP
with the def bound(@params) determinging the bound of current node of space tree.