TSP attempt
Posted: Sun Feb 19, 2012 8:36 pm
Travelling salesman problem. (http://www.tsp.gatech.edu/vlsi/index.html) not sure if anyone is interested in this stuff.
xqf131
3 different methods produces paths with no cross-overs (no where near optimal path)
(left click will step through the process of finding the path).
but mainly because i don't want to lose this code as i am about to wipe out my whole computer to upgrade to Fedora 16.
xqf131
3 different methods produces paths with no cross-overs (no where near optimal path)
(left click will step through the process of finding the path).
but mainly because i don't want to lose this code as i am about to wipe out my whole computer to upgrade to Fedora 16.