图的最小生成树

 

1. void MiniSpanTree_PRIM(MGraph G,VertexType u){
2.     struct {
3.         VertexType adjvex;
4.         VRType lowcost;
5.     }closedge[MAX_VERTEX_NUM];
6.     int k=LocateVex(G,u);
7.     for(int j=0;j<G.vexnum;++j)
8.         if(j!=k){
9.             closedge[j].adjvex=u;
10.             closedge[j].lowcost=G.arcs[k][j].adj;
11.         }
12.         closedge[k].lowcost=0;
13.         printf("Prim 算法输出最小生成树/n");
14.         for(int i=1;i<G.vexnum;++i){
15.             int min=INFINITY;
16.             int k1=0;
17.             for(int n=0;n<G.vexnum;++n){
18.                 if(closedge[n].lowcost){
19.                     if(closedge[n].lowcost<min){
20.                         min=closedge[n].lowcost;
21.                         k1=n;
22.                     }
23.                 }
24.             }
25.             printf("%c-->%c  ",closedge[k1].adjvex,G.vexs[k1]);
26.             closedge[k1].lowcost=0;
27.             for(int j1=0;j1<G.vexnum;++j1)
28.                 if(G.arcs[k1][j1].adj<closedge[j1].lowcost){
29.                     closedge[j1].lowcost=G.arcs[k1][j1].adj;
30.                     closedge[j1].adjvex=G.vexs[k1];
31.                 }
32.         }
33.         printf("/n");
34. }