oupheader">Detailed Description</h2>
<div class="textblock"><h3>template&lt;typename CM&gt;<br/>
class lemon::GreedyTsp&lt; CM &gt;</h3>

<p><a class="el" href="a00192.html" title="Greedy algorithm for symmetric TSP. ">GreedyTsp</a> implements the greedy heuristic for solving symmetric <a class="el" href="a00618.html">TSP</a>.</p>
<p>This algorithm is quite similar to the <a class="el" href="a00273.html">nearest neighbor</a> heuristic, but it maintains a set of disjoint paths. At each step, the shortest pos