From: Michael Held (michael.held_at_[hidden])
Date: 2007-10-08 09:18:04
Yhank you very much. Your reply was *very* helpful and the code worked
out of the box.
What should be done to bring TSP closer to boost?
So far the TSP approximation of a list of 2D points is straight forward
implemented (using the Euclidean distance between each pair of points as
edge weight). I guess this needs to be generalized for a boost integration.
But I would like to include his 'tsp_2_approximation' shortcut, as it
solves the probably most common TSP problem: return the tour indices for
a given list of points...
Douglas Gregor wrote:
> On Oct 3, 2007, at 2:28 AM, Michael Held wrote:
>> is there any traveling salesman implementation in BGL available or is
>> anything in this direction planned?
> Matyas Egyhazy posted an implementation of the TSP-2 approximation
> algorithm for the BGL here:
> It hasn't been reviewed for inclusion in the BGL, but it should be.
>> I could need such an implementation and would like to volunteer to
>> implementing/porting such an algorithm. with the help of this
>> - of course ;-)
> - Doug
> Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk