最小生成树

输入

输出

样例输入

样例输出

 1 #include <stdio.h>
 2 #define N 55
 3 #define INF 600000
 4 #define INF2 600001
 5 typedef struct g{
 6     int arc[N][N];
 7     int arcNum,verNum;
 8     int maxWeight;
 9 }Graph;
10 typedef struct {
11     int adjvex;
12     int lowcost;
13 }Closedge;
14 void Create(Graph *G,int n){
15     int i,j;
16     G->verNum = G->arcNum = n;
17     G->maxWeight = 0;
18     for(i = 0; i < G->arcNum; i++)
19         for(j = 0; j < G->arcNum; j++){
20             scanf("%d",&G->arc[i][j]);
21             if(G->maxWeight < G->arc[i][j])
22                 G->maxWeight = G->arc[i][j];
23         }
24 }
25 void Prim(Graph *G,int &spent){
26     Closedge closedge[N];
27     int i,j,k,min,minVer;
28     //初始化数组closedge
29     for(i = 0; i < G->verNum; i++){
30         closedge[i].adjvex = 0;//从结点 0 开始
31         if(G->arc[0][i])
32             closedge[i].lowcost = G->arc[0][i];
33         else
34             closedge[i].lowcost = INF;
35     }
36  
37     closedge[0].lowcost = INF2;
38      
39     for(j = 0; j < G->verNum - 1; j++){
40         min = G->maxWeight;
41         //选择最小的边
42         for(k = 0; k < G->verNum; k++)
43             if(closedge[k].lowcost && min > closedge[k].lowcost){
44                 min = closedge[k].lowcost;
45                 minVer = k;//closedge[k].adjvex
46             }
47         spent += min;
48         closedge[minVer].lowcost = INF2;//加入入选集合
49         //查找顶点minVer到没入选顶点的“花费” minVer = 1;
50         for(k = 0; k < G->verNum; k++){
51             if(closedge[k].lowcost != INF2 && G->arc[minVer][k] < closedge[k].lowcost && G->arc[minVer][k]){
52                 closedge[k].adjvex = k;
53                 closedge[k].lowcost = G->arc[minVer][k];
54             }
55         }
56     }
57 }
58 int main(){
59     int n;
60     Graph G;
61     scanf("%d",&n);
62     Create(&G,n);
63     int m = 0;
64     Prim(&G,m);
65     printf("%d\n",m);
66     return 0;
67 }