Doug,
Thank you for the feedback. The visualization stuff was definitely for
the purposes of the homework assignment only - and the vertex naming
convention was also so the vertices would have names in the neato
graphs. These can be removed from the implementation. One other
modification I was thinking of was to use a lookup map for saving the
edge weights (lengths) after they have been calculated so they do not
have to be calculated multiple times.
To make the interface as simple as possible I can remove the ostreams
and the graph parameter so the algorithm requires only the position map
for the vertices and returns the predecessor mapping for the TSP
2-approximation tour.
Something like:
template
On Jul 27, 2006, at 9:04 PM, Matyas W Egyhazy wrote:
I recently implemented an approximation for the traveling salesperson using the boost graph library. The interface as well as the implementation are not polished and they require improvement, mostly due to the work being part of a school homework assignment. If anyone is interested, I would like outside comments before spending (or wasting, if no one is interested) effort to fix it up.
I think this would make a good addition to the BGL. You'll probably want to separate out the core algorithm from the name handling/ initialization/display code a bit more, but it looks like it's in good shape.
Doug _______________________________________________ Boost-users mailing list Boost-users@lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users