fibmain.cpp

应用斐波纳契堆和邻接表改进单源最短路径算法

#include"graph.h"
void main()
{
	Graph x(7);
	int a=0,b=0,c=0;
	while(1)
	{
		cin>>a>>b>>c;
		if(c==0)
			break;
		x.Insert(a,b,c);
	}
	cout<<"ddd"<<endl;
	x.ShortestPath(7,0);
	for(int i=0;i<7;i++)
		cout<<x.path[i]<<",";
	cout<<endl;
}