is listed below.
</p>

<table>
<tr>
<td valign="top">
<pre>
TSP-APPROX(<i>G</i>, <i>w</i>)
  select a vertex <i>r</i> <i>in</i> <i>V[G]</i>
  compute a minimum spanning tree <i>T</i> for <i>G</i> from root <i>r</i>
    using PRIM-MST(<i>G</i>, <i>r</i>, <i>w</i>)
  let <i>L</i> be the list of vertices visited in a preorder traversal of <i>T</i>
  <b>return</b> (the Hamiltonian cycle <i>H</i> that visites the vertices in the order <i>L</i>)
</pre>
</td>
</tr>
</table>


<H3>Where Defined</H3>

<P>
<a href=".