its&lt;VertexListGraph&gt;::vertex_descriptor start,
    WeightMap w, TSPVertexVisitor vis)

</PRE>

<P>
This is a traveling salesperson heuristic for generating a tour of vertices
for a fully connected undirected graph with weighted edges that obey the triangle inequality.
The current implementation is based off of the algorithm presented in <i>Introduction to Algorithms</i>
on page 1029.  This implementation generates solutions that are twice as long as the optimal tour in the worst case.
The pseudo-code 