c++ 用STL容器实现Dijkstraalg问题

#include"CEdge.h"

#include"tryy.h"

#include"add.h"

class cgraph

{

private: int numvertex,numedge;

		 list<cedge *>incidentlist;

		 map<int,cvertex *>mapVID_vertex; // all cvertex

		 list<cvertex *>listtempmark;// 暂时标记的顶点的集合

		 map<int,list<cedge*>>mapVID_listedge;//记录与顶点关联的出度边;

		 



public:

	cgraph(char* inputFile);

	cgraph(list<cedge*> listedge);

	cgraph(cgraph &);

	~cgraph();

	int getnumvertex();

	int getnumedge();

	void Dijkstraalg(int s);

	list<cedge*> getlist();

    void PrintShortestPath(int s, int d);

    void PrintAllShortestPath(int s);

    void DeleteIncidentList(int c);

	void  update(int VID);

	void pro2_1output();

	void update2(int VID);

	void Dijkstraalg2(int s);

};



void cgraph::update(int VID)

{

  list<cedge *> ledge=mapVID_listedge[VID];

  list<cedge *>::iterator i, iend;

  iend=ledge.end();

  for(i=ledge.begin();i!=iend;i++)

  {

	  int w=(*i)->getWeight();

	  cvertex* h=mapVID_vertex[(*i)->getHead()];

	  cvertex* t=mapVID_vertex[VID];

	  if(t->d+w<h->d)

	  {

		  h->d=t->d+w;

		  h->p=VID;

	  }



  }

}



void cgraph::Dijkstraalg(int s)

{

	map<int,cvertex*>::iterator i,iend;

	iend=mapVID_vertex.end();

	for(i=mapVID_vertex.begin();i!=iend;i++)

	{

		if(i->second->ID==s)

			i->second->d=0;

		listtempmark.push_back(i->second);

	}

	update(s);

	while(!listtempmark.empty())

	{

		listtempmark.sort(pvertexcomp);

		int j=(*listtempmark.begin())->ID;

		listtempmark.pop_front();

		update(j);







	}

}



cgraph::cgraph(char* inputFile)

{

 ifstream file(inputFile);



 file>>numvertex>>numedge;

 for (int i = 0; i < numvertex; i++)

 {

 cvertex* vp;

 vp = new cvertex(INFINITY, NULL, i);

 mapVID_vertex[i] = vp;

 }

 for (int i = 0; i< numedge; i++)

 {

 int edgid,head, tail, weight,capacity; //对input函数进行修改，增加容量

 file>>edgid>>head>>tail>>weight>>capacity;

 cedge *ep = new cedge(edgid,head, tail, weight,capacity);

 incidentlist.push_back(ep);

 list<cedge*> templist;

 templist = mapVID_listedge[tail];

 mapVID_listedge[tail].push_back(ep);

 }



file.close();

}



void cgraph::PrintShortestPath(int s, int d)

{

 cout<< " the length of the shortest path from "<<s<<" to "<<d<<" is: "<<mapVID_vertex[d]->d<<endl;

 cout<< " the shortest path from "<<s<<" to "<<d<<" is: ";



list<int> shortest;

 shortest.push_front(d);

 int pre = d;

 while(s!=pre)

 {

 pre = mapVID_vertex[pre]->p;

 shortest.push_front(pre);

 }



list<int>::iterator beg, tempiter;

 for(beg = shortest.begin();beg != shortest.end();beg++)

 {

 cout<<*beg << " ";



}

 cout<<endl;

}



void cgraph::PrintAllShortestPath(int s)

{

 map<int, cvertex*>::iterator mapiter ;

 for (mapiter = mapVID_vertex.begin(); mapiter != mapVID_vertex.end(); mapiter++)

 {

 if ( s != mapiter->second->ID)

 {

 PrintShortestPath(s, mapiter->second->ID);

 }

 }

}



cgraph::~cgraph()

{

}

// ****************************************************主函数部分**************************//

int main()

{

 cgraph* graph = new cgraph("dijkstra.txt");

	graph->Dijkstraalg(1); //测试源结点为1的所有最短路的dijkstra和相应输出 

	graph->PrintAllShortestPath(1);

	

	cout<<"function pro2_1"<<endl;

	graph->PrintShortestPath(1,8);//单源单宿测试 



	graph->Dijkstraalg2(1);  //pro2_2

	cout<<"function pro2_2"<<endl;

	graph->PrintAllShortestPath(1); 

	int c;

	cout<<"input the lower limit capacity"<<endl;

	cin>>c;

	void DeleteIncidentList(int c); //pro2_3

	graph->Dijkstraalg(1);//仍以1为例，假设删除小于c权重的边后1节点仍在图中

	cout<<"function pro2_3"<<endl;

	graph->PrintShortestPath(1,8);



	

	





}