/************************ NEARESTNEIGHBOR.H ***********************************
* TSP Algorithms : NearestNeighbor                                 21.11.2008 *
*                                                                             *
* - Start at vertex v1                                                        *
* - Trace (v1,v2) which is the shortest edge from v1.                         *
* - Leave v2 along (v2,v3) the shortest edge from v2.                         *
* - Keep the cycle simple.                                                    *
* - Continue until every vertex has been visited.                             *
* - Complete the cycle by edge (vn,v1).                                       *
*                                                             Beycan Kahraman *
******************************************************************************/

#pragma once
#include "AlgorithmTSP.h"

class NearestNeighbor :
	public AlgorithmTSP
{
public:
	NearestNeighbor(short dist[][SZ], int n);
	virtual void Run();
	~NearestNeighbor(void);
};
