willowlark / tsp_solver Goto Github PK
View Code? Open in Web Editor NEWA set of solvers for the Travelling Salesman problems. Uses Nearest neighbor, brute force, branch & bound, and an example of algorithm conversion. Projects for Design of Algorithms class.