town.h

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

#ifndef _TOWN_H
#define _TOWN_H
#include "list.h"
#include <string>
using namespace std;

class town
{
private:
	string townName;
    list* edges;

public:
	/* Constuctor and Destructor */
	town();
    ~town();    
	void setTownName(string townName_Info);
	string getTownName();
	void setList(list* edges_Info);
	void setList(double* data, int size, int townsize);
    list* getList();
};
#endif