connection.h

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

#ifndef _CONNECTION_H
#define _CONNECTION_H

class connection
{
private:
	int index_start;
	int index_end;
	double km;

public:
	/* Constuctor and Destructor */
	connection();

	void setIndex_start(int index);
	void setIndex_end(int index);
	void setKm(double Km);
	int getIndex_start();
	int getIndex_end();
	double getkm();
};
#endif