dijkstra.h

使用DIJKSTAR算法解决多点最短路径,还带文字解说

#ifndef _DIJKSTRA_H
#define _DIJKSTRA_H
#include "map.h"
#include <vector>
using namespace std;

struct RArray
{
	string townName;
	double nearestkm;
};
class dijkstra
{
private:
//	town* town_first;			//没有用的变量
	int index_start;	//城市序号  从0开始
    RArray* result;		//数组  保存input文件中每个城市到index_start城市的最短距离
	vector<int> a;		//保存已经处理过的城市的序号

public:
	/* Constuctor and Destructor */
	dijkstra();
	~dijkstra();
    RArray* doDijkstra(map* townmap, string * a);
	void printResult(RArray* result, int TownSize);
	int getMinTown(RArray* res, vector<int> a, int TownSize);
	bool isInA(vector<int> a, int index);
	void SetStartTownIndex(int nTown) {index_start = nTown;}
};
#endif