The Unique MST POJ - 1679 最小生成树和次小生成树

最新推荐文章于 2022-03-08 21:02:39 发布

原创最新推荐文章于 2022-03-08 21:02:39 发布 · 152 阅读

本内容遵循CC 4.0 BY-SA版权协议

本文介绍了一种算法，用于判断给定的无向连通图是否存在唯一的最小生成树（MST）。通过定义生成树和最小生成树的概念，输入一组节点和边权重，输出MST是否唯一或其总成本。该算法首先找到MST，然后检查是否可以通过替换非MST边来改变总成本，从而判断MST的唯一性。

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:

V’ = V.
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!

找到最小生成树中生成的边中的最大值然后去用未使用的边来替换

#include<iostream>
#include<algorithm>
#include<cstring>
#include<string>
#include<stack>
#include<vector>
#include<cmath>
#include<queue>
using namespace std;
typedef long long ll;
#define inf 0x3f3f3f3f
#define m(a) memset(a,0,sizeof(a))
#define mm(a) memset(a,-1,sizeof(a))
#define mi(a) memset(a,0x3f3f3f3f,sizeof(a))
int a[105][105],d[105],vis[105],maxx[105][105],use[105][105],pre[105];
int main(){
    int t,n,m,x,y,z;cin>>t;
    while(t--){
        cin>>n>>m;
        m(vis);m(maxx);m(use);m(a);
        for(int i=1;i<=n;i++){
            for(int j=i+1;j<=n;j++){
                a[i][j]=a[j][i]=inf;
            }
        }
        for(int i=1;i<=m;i++){
            cin>>x>>y>>z;
            a[x][y]=a[y][x]=z;
        }
        for(int i=1;i<=n;i++){
            d[i]=a[1][i];
            pre[i]=1;
        }
        int ans=0,res=inf;
        for(int i=1;i<=n;i++){
            int minn=inf,q;
            for(int j=1;j<=n;j++){
                if(!vis[j]&&d[j]<minn){
                    minn=d[j],q=j;
                }
            }
            ans+=d[q];
            vis[q]=1;
            use[q][pre[q]]=use[pre[q]][q]=1;
            for(int j=1;j<=n;j++){
                if(q!=j&&vis[j]){
                    maxx[q][j]=maxx[j][q]=max(maxx[j][pre[q]],d[q]);
                }
                if(!vis[j]&&d[j]>a[q][j]){
                    d[j]=a[q][j];pre[j]=q;
                }
            }
        }
        for(int i=1;i<=n;i++){
            for(int j=1;j<=n;j++){
                if(i==j)continue;
                if(use[i][j]==0)res=min(res,ans+a[i][j]-maxx[i][j]);
            }
        }
        if(ans==res){
            cout<<"Not Unique!"<<endl;
        }
        else{
            cout<<ans<<endl;
        }
    }
}