说明: PrimMinSpanTree(mgraph g,int k) { int i,j,min,p; struct { int adjvex; int lowcost; }closedge[MAX_VERTEX_NUM]; for(j=1;j<=g.vexnum;j++) if(j!=k) { closedge[j].adjvex=k; closedge[j].lowcost=g.arcs[k][j]; } closedge[k].lowcost=0; for(i=1;i<g.vexn
<djqtdj> 上传 | 大小:990byte