connection.cpp

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

    #include "connection.h"

    connection::connection()
	{
		index_start=0;
		index_end=0;
		km=0;
	}

	void connection::setIndex_start(int index)
	{
		index_start = index;
	}

	void connection::setIndex_end(int index)
	{
		index_end = index;
	}

	void connection::setKm(double Km)
	{
		km = Km;
	}

	int connection::getIndex_start()
	{
        return index_start;
	}

	int connection::getIndex_end()
	{
        return index_end;
	}

	double connection::getkm()
	{
        return km;
	}