tsp.h

本程序实现了NPC问题旅行商的三个近似算法。

#define N 32
#include <iostream.h>
#include <stdio.h>
#include <algorithm>
using namespace std;

class tsp
{
public:
	tsp();
	~tsp();
	bool LoadGraph();
	bool NearestNeighbor();
	bool ShortestLinkHeuristic();
	bool NearestInsertion();
	int findaedge(bool *, int);
private:
	int iCityNum;
	int Graph[N][N];
};

struct edge_info
{
	int fee;
	int c1, c2;
};

struct link_state
{
	int p[2], neighbor;
};