Page 1 of 1

TSP attempt

PostPosted: Sun Feb 19, 2012 8:36 pm
by tintran
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.

Re: TSP attempt

PostPosted: Thu Feb 23, 2012 3:13 am
by Hblade
Interesting... this is nice!

Re: TSP attempt

PostPosted: Thu Feb 23, 2012 11:53 pm
by SuperSonic
Wierd, but cool. Nice job :wink:

Re: TSP attempt

PostPosted: Tue Feb 28, 2012 1:00 am
by happyjustbecause
I'm not entirely sure how it works, or what it does, but I tried it out, and it is pretty cool. :)