POJ-1679.The Unique MST.(Prim求次小生成树)

The Unique MST

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 39561		Accepted: 14444

Description

Given a connected undirected graph, tell if its minimum spanning tree is unique.

Definition 1 (Spanning Tree): Consider a connected, undirected graph G = (V, E). A spanning tree of G is a subgraph of G, say T = (V', E'), with the following properties: 
1. V' = V. 
2. T is connected and acyclic.

Definition 2 (Minimum Spanning Tree): Consider an edge-weighted, connected, undirected graph G = (V, E). The minimum spanning tree T = (V, E') of G is the spanning tree that has the smallest total cost. The total cost of T means the sum of the weights on all the edges in E'.

Input

The first line contains a single integer t (1 <= t <= 20), the number of test cases. Each case represents a graph. It begins with a line containing two integers n and m (1 <= n <= 100), the number of nodes and edges. Each of the following m lines contains a triple (xi, yi, wi), indicating that xi and yi are connected by an edge with weight = wi. For any two nodes, there is at most one edge connecting them.

Output

For each input, if the MST is unique, print the total cost of it, or otherwise print the string 'Not Unique!'.

Sample Input

2
3 3
1 2 1
2 3 2
3 1 3
4 4
1 2 2
2 3 2
3 4 2
4 1 2

Sample Output

3
Not Unique!

Source

POJ Monthly--2004.06.27 srbga@POJ

 

本题大意：给定一个无向图，让你判断这个图的最小生成树是否唯一。

本题思路：我们可以求出这个图的次小生成树，判断如果Second_MST > MST则说明这个图G只存在一颗最小生成树，相等则说明存在不止一颗最小生成树。

参考代码：

Prim解法：

 #include <cstdio>
 #include <cstring>
 #include <algorithm>
 using namespace std;

 const int maxn =  + , maxe =  *  /  + , INF = 0x3f3f3f3f;
 int n, m, lowc[maxn], pre[maxn], cost[maxn][maxn], Max[maxn][maxn];
 bool vis[maxn], used[maxn][maxn];

 int Prim(int source) {
     int ans = ;
     memset(vis, false, sizeof vis);
     memset(Max, , sizeof Max);
     memset(used, false, sizeof used);
     for(int i = ; i <= n; i ++) {
         lowc[i] = cost[source][i];
         pre[i] = source;
     }
     pre[source] = -;
     lowc[source] = ;
     vis[source] = true;
     for(int i = ; i <= n; i ++) {
         int MIN = INF, k = -;
         for(int j = ; j <= n; j ++)
             if(!vis[j] && MIN > lowc[j]) {
                 MIN = lowc[j];
                 k = j;
             }
         if(MIN == INF) return -;
         vis[k] = true;
         ans += MIN;
         used[pre[k]][k] = used[k][pre[k]] = true;//这里记得要把现在访问的边进行标记
         for(int j = ; j <= n; j ++) {
             if(vis[j] && j != k)
                 Max[k][j] = Max[j][k] = max(Max[pre[k]][j], lowc[k]);//每次加入一个顶点，就将这个顶点到达其他顶点路径上的最大边权进行更新
                 //为什么要这样更新呢？我们知道一个顶点在还没有加入最小生成树时它距离MST中各边顶点的最小值可以由它的父亲结点到j结点和它本身到MST结点的最小值的最大值来表示
             if(!vis[j] && lowc[j] > cost[k][j]) {
                 lowc[j] = cost[k][j];
                 pre[j] = k;
             }
         }
     }
     return ans;
 }

 int Second_Prim(int MST) {
     int ans = INF;
     for(int i = ; i <= n; i ++)
         for(int j =  + i; j <= n; j ++)
             if(!used[i][j] && cost[i][j] != INF)
                 ans = min(ans, MST - Max[i][j] + cost[i][j]);
     return ans;
 }

 int main () {
     int t, u, v, w;
     scanf("%d", &t);
     while(t --) {
         scanf("%d %d", &n, &m);
         memset(cost, INF, sizeof cost);
         for(int i = ; i <= m; i ++) {
             scanf("%d %d %d", &u, &v, &w);
             cost[u][v] = cost[v][u] = w;
         }
         int MST = Prim();
         int Second_MST = Second_Prim(MST);
         if(Second_MST > MST)
             printf("%d\n", MST);
         else printf("Not Unique!\n");
     }
     return ;
 }