POJ 1679 The Unique MST
来源:互联网 发布:陈柏霖人品好吗 知乎 编辑:程序博客网 时间:2024/04/30 12:55
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'.
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
23 31 2 12 3 23 1 34 41 2 22 3 23 4 24 1 2
Sample Output
3Not Unique!
题意:判断最小生成树是否唯一
用PRIM算法来判断,当我们扩展一个节点u时,得到最小边min,然后判断在已经扩展的集合中是否有大于1条边权值等于min,如果有则最小生成树不唯一,反之唯一。
CODE:
#include<stdio.h>const int INF=1<<30;int n,m;int matrix[105][105];int dist[105];int prim(){ int u,k,ans=0,flag=0; char used[105]={0}; for(int i=1; i<=n; i++) { dist[i]=matrix[1][i]; } used[1]=1; for(int i=1; i<n; i++) { int min=INF; for(int j=1; j<=n; j++) { if(!used[j]&&dist[j]<min) { min=dist[j]; u=j; } } k=0; for(int j=1; j<=n; j++) { if(used[j]&&min==matrix[u][j])k++; } used[u]=1; if(k>1) { return -1; } ans+=min; for(int j=1; j<=n; j++) if(!used[j]&&matrix[u][j]<dist[j])dist[j]=matrix[u][j]; } return ans;}int main(){ //freopen("in.txt","r",stdin); int tCase,ans; scanf("%d",&tCase); while(tCase--) { scanf("%d%d",&n,&m); for(int i=1; i<=n; i++) for(int j=1; j<=n; j++)matrix[i][j]=INF; for(int i=1; i<=m; i++) { int u,v,w; scanf("%d%d%d",&u,&v,&w); matrix[u][v]=matrix[v][u]=w; } ans= prim(); if(ans==-1)printf("Not Unique!\n"); else printf("%d\n",ans); } return 0;}
- POJ 1679 The Unique MST
- poj 1679 The Unique MST
- poj 1679 The Unique MST
- POJ 1679 The Unique MST
- poj 1679 The Unique MST
- poj 1679 The Unique MST
- POJ-1679 The Unique MST
- POJ 1679 The Unique MST
- POJ 1679 The Unique MST
- POJ-1679-The Unique MST
- Poj 1679 The Unique MST
- poj 1679 The Unique MST
- POJ-1679-The Unique MST
- POJ 1679 The Unique MST
- POJ 1679 The Unique MST
- POJ-1679-The Unique MST
- poj 1679 The Unique MST
- poj 1679-The Unique MST
- 类图
- Netbeans快捷键及相关
- JQuery Ajax 在asp.net中使用总结
- Win7 在IIS中增加MIME类型文件
- 游戏优化
- POJ 1679 The Unique MST
- allocator能做什么
- jquery 编码解码
- Tomcat's administration web application is no longer installed by default. Download and install the
- 把笔记本作为wifi热点
- JQuery+UI+API
- 英语词汇17
- 中波调幅干扰实验
- DLP和DRM厂商合作推动企业信息安全保护