Travelling salesman variation in python

[Erlend Andreas Garberg]

In article <c4ialj$mcq$1 at news.service.uci.edu>, Josiah Carlson wrote:
> One approximate solution to the TSP is the bitonic TSP.  That is, start 
> at the leftmost point, find a path to the rightmost point, then find a 
> return path to the leftmost point.

The problem is that all nodes are connected to all the other nodes, and 
the weights are in essence random.. So it won't be possible to find 
leftmost/rightmost point.

--
mvh
Erlend Garberg
erlendga at ifi.uio.no