map.h

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

#ifndef _MAP_H
#define _MAP_H
#include "town.h"
class map
{
private:
	int townSize;
    town* maps;

public:
	/* Constuctor and Destructor */
	map();
	map(int townSize);
    ~map();    
	//void setMap(map* town_map);
	void setMap(string *name, double *km);
    town* getMap();
	void setTownSize(int townSize);
	int getTownSize();
	void printMap();
    town* getTownIndex(int Size);
	
};
#endif