main.cpp

Dijkstrat和Floyd算法实现。 算法请参考《通信网理论基础》周炯磐

#include <iostream.h>
#include "Main.h"
void main(void)
{
//	double **gr;//[MAX_POINTNUM];
	DijkstraData DiDa;
	
	DijkstraFloyd DF(POINTNUM,GrobalG);
	DF.Dijkstra(0,DiDa);
//	DF.PrintDijkstra(0);
	int Road[POINTNUM];
	int RoadLength;
	DF.GetPointToPointRoad(0,3,Road);
	for(int i=0;i<POINTNUM;i++)
	{
		DF.FloydGetPointToPointRoad(0,i,Road);
		RoadLength=Road[0];
		cout<<1<<"-->\t";
		while(RoadLength>0)
		{
			cout<<Road[RoadLength--]+1<<"-->\t";
		}
		cout<<i+1<<"\t"<<endl;
	}
	cout<<"OK!"<<endl;
	Graph Weight,Relation;
	DF.Floyd(Weight,Relation);
}