/************************* SIMPLEAPPROACH.H ***********************************
* TSP Algorithms : SimpleApproach                                  21.11.2008 *
*                                                                             *
* - Find a Hamilton cycle C                                                   *
* - Creating new cycles that has a better solution                            *
*     - deleting edges vi-vi+1 and vj-vj+1                                    *
*     - adding edges vi-vj and vi+1-vj+1                                      *
*     - If for some i and j,                                                  *
*       w(vi-vj) + w(vi+1-vj+1) < w(vi-vi+1) + w(vj-vj+1)                     *
* - Cij is an improvement on C.                                               *
*                                                             Beycan Kahraman *
******************************************************************************/

#pragma once
#include "AlgorithmTSP.h"

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