最小生成树(Prim算法).docVIP

#includeiostream using namespace std; const int defaultSize=50; const int Max=1000; templateclass E //T是顶点类型,E是权的类型 struct MSTEdgeNode //MST边结点 { int head; //头结点 int tail; //尾结点 E weight; MSTEdgeNode() { head=0; weight=Max; } }; templateclass E class MinSpanTree { private: MSTEdgeNodeE*edgevalue; E **Array; //链接矩阵 int vernum; //图中顶点的个数 int edgenum; //图中边的个数 int n; //MST边数 double mst; //MST的最小权值和 int FindMinWeight(int start) //找出权值最小的结点位置 { if(start=vernum-1) return -1; int i=start; int pos=i; E min=edgevalue[i].weight; for(;ivernum-1;i++) { if(edgevalue[i].weightmin) { min=edgevalue[i].weight; pos=i; } } return pos; } void Adjust(int start) //从start位置开始调整 { if(start0 || start=vernum-1) return; int i=start+1; int u=edgevalue[start].tail; while(ivernum-1) { int v=edgevalue[i].tail; if(Array[u][v]edgevalue[i].weight) { edgevalue[i].head=u; edgevalue[i].weight=Array[u][v]; } i++; } } public: MinSpanTree() { int i,j; cout请输入图的顶点个数:; cinvernum; if(vernum=0) { cerr输入参数错误!endl; return; } edgevalue=new MSTEdgeNodeE[vernum-1]; for(i=0;ivernum-1;i++) edgevalue[i].tail=i+1; Array=new E*[vernum]; for(i=0;ivernum;i++) { Array[i]=new E[vernum]; } for(i=0;ivernum;i++) { for(j=0;jvernum;j++) { if(i==j) Array[i][j]=Array[j][i]=0; else Array[i][j]=Array[j][i]=Max; } } cout请输入边的个数:; cinedgenum; if(edgenum=0) { cerr输入参数错误!endl; return; } int k; E w; for(k=0;kedgenum;k++) { cout输入第k条边的起点:; cini; cout输入第k条边的终点:; cinj; cout输入第k条边的权值:; cinw; Array[i][j]=Array[j][i]=w; if(i==0) edgevalue[j-1].weight=w; } n=0; mst=0; } void MST() //生成最小生成树 { int start; int i; start=0; while(nvernum-1) { i=FindMinWeight(start); if(i!=-1) { if(i!=start)