HDU 1233 prim kruskal最小生成树模板题

 1 #include <iostream>
 2 using namespace std;
 3 #define INF 999999999
 4 
 5 int map[101][101],visit[101],dis[101],N;
 6 int prim()
 7 {
 8     for(int i = 2; i <= N; i++)
 9     {
10         visit[i] = 0;
11         dis[i] = map[i][1];
12     }
13     visit[1] = 1;
14     int sum = 0;
15     for(int i = 1; i <= N-1; i++)
16     {
17         int temp = INF,pos; 
18         for(int j = 1; j <= N; j++)
19         {
20             if(!visit[j] && dis[j] < temp)
21             {
22                 temp = dis[j];
23                 pos = j;
24             }    
25         }
26         visit[pos] = 1;
27         sum += dis[pos];
28         for(int j = 1; j <= N; j++)
29         {
30             if(!visit[j] && dis[j] > map[pos][j] && map[pos][j]!= INF)
31                 dis[j] = map[pos][j];
32         }
33     }
34     return sum;
35 } 
36 
37 int main()
38 {
39     while(scanf("%d",&N),N)
40     {
41         int u,v,w;
42         for(int i = 1; i <= N; i++)
43             dis[i] = INF; 
44         for(int i = 1; i <= (N*(N-1))/2; i++)
45         {
46             scanf("%d%d%d",&u,&v,&w);
47             map[u][v] = map[v][u] = w;
48         }
49         cout<<prim()<<endl;
50     }
51 }

 1 #include <iostream>
 2 #include <cstdio>
 3 #include <algorithm>
 4 #define  maxn 103 
 5 using namespace std;
 6 
 7 int father[maxn];
 8 struct edges 
 9 {
10     int pre;
11     int suc;
12     int w;
13 }edge[5000];
14 
15 int cmp(edges x, edges y)
16 {
17     return (x.w < y.w)?1:0;
18 }
19 int find(int x)
20 {
21     if(father[x] == x)return x;
22     return father[x] = find(father[x]);
23 }
24 int kruskal(int n,int es)
25 {
26     for(int i = 1; i <= n; i++)
27     {
28         father[i] = i;
29     }
30     sort(edge+1,edge+1+es,cmp);
31     int sum = 0;
32     for(int i = 1; i <= es; i++)
33     {
34         int fx = find(edge[i].pre),fy = find(edge[i].suc);
35         if(fx != fy)
36         {
37             father[fx] = fy;
38             sum += edge[i].w;
39         }
40     }
41     return sum;
42 }
43 int main()
44 {
45     int  n,es;
46     while(scanf("%d",&n),n)
47     {
48         es = (n*(n-1))/2;
49         for(int i = 1; i <= es; i++)
50         {
51             scanf("%d%d%d",&edge[i].pre,&edge[i].suc,&edge[i].w);
52         }
53         int ans = kruskal(n,es);
54         printf("%d\n",ans);
55     }
56     
57 }