sible edge is added to these paths as long as it does not create a cycle of less than n edges and it does not increase the degree of any node above two.</p>
<p>This method runs in O(n<sup>2</sup>) time. It quickly finds a relatively short tour for most TSP instances, but it could also yield a really bad (or even the worst) solution in special cases.</p>
<dl class="tparams"><dt>Template Parameters</dt><dd>
  <table class="tparams">
    <tr><td class="paramname">CM</td><td>Type of the cost map. </td></tr>
  <