poj1679 次小生成树

次小生成树

题目： http://poj.org/problem?id=1679

题目大意：判断一个连通图的最小生成树是否唯一。

思路：求出次小生成树，比较一下即可， 次小生成树的解法：先求出最小生成树，枚举最小生成树上边i，利用其余的m-1条边建立最小生成树，比较两次生成树权重即可。

 

注意：一定要注意去掉边后没有生成树的情况。

 

提交情况：wa了数次。

 

AC code：

#include <cstdio>

#include <cstring>

#include <algorithm>

using namespace std;

 

#define MAXN 110

#define MAXM 100100

 

struct edgeNode{

         int u, v, dis;

};

 

edgeNode edges[MAXM];

int f[MAXN];

int used[MAXN];

 

bool comp(const edgeNode &A, edgeNode &B){

         return A.dis < B.dis;

}

 

void clear(int n){

         for(int i = 1; i <= n; ++ i){

                   f[i] = i;

         }

}

 

int find(int x){

         if(x != f[x]) f[x] = find(f[x]);

         return f[x];

}

 

void Union(int x, int y){

         f[x] = y;

}

 

bool judge(int n, int m, int min){

         int ans, p;

         for(int i = 0; i < n - 1; ++ i){

                   clear(n);

                   ans = p = 0;

                   for(int j = 0; j < m; ++ j){

                            if(j == used[i]) continue;

                            int fx = find(f[edges[j].u]);

                            int fy = find(f[edges[j].v]);

                            if(fx != fy){

                                     ans += edges[j].dis;

                                     p ++;

                                     Union(fx, fy);

                            }

                   }

                   if(p == n - 1 && ans == min) return 1;

         }

         return 0;

}

 

int main(){

         int CASE, n, m, ans, k;

         scanf("%d", &CASE);

         while(CASE --){

                   scanf("%d %d", &n, &m);

                   for(int i = 0; i < m; ++ i){

                            scanf("%d %d %d", &edges[i].u, &edges[i].v, &edges[i].dis);

                   }

                   clear(n);

                   ans = k = 0;

                   sort(edges, edges + m, comp);

                   for(int i = 0; i < m; ++ i){

                            int fx = find(f[edges[i].u]);

                            int fy = find(f[edges[i].v]);

                            if(fx != fy){

                                     ans += edges[i].dis;

                                     used[k ++] = i;

                                     Union(fx, fy);

                            }

                   }

                   int flag = judge(n, m, ans);

                   if(flag) printf("Not Unique!\n");

                   else printf("%d\n", ans);

         }

         return 0;

}