The Unique MST 2017 暑期 学习 次小生成树
来源:互联网 发布:罗麦品质365商城淘宝网 编辑:程序博客网 时间:2024/06/07 13:01
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'.
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.
For each input, if the MST is unique, print the total cost of it, or otherwise print the string 'Not Unique!'.
23 31 2 12 3 23 1 34 41 2 22 3 23 4 24 1 2
3Not Unique!
#include <cstdio>
#include <cstring>
#include <algorithm>using namespace std;struct node{ int x,y,dis; int flag;} a[10005];int cmp(node x,node y){ return x.dis<y.dis;}int root[105],n;int findroot(int x){ if (root[x]==x) return x; root[x]=findroot(root[x]); return root[x];}int kruskal(int num,int m){ int ans=0,cnt=1; for (int i=0;i<m;i++) { if(i==num) continue; int r1=findroot(a[i].x); int r2=findroot(a[i].y); if (r1!=r2) { ans+=a[i].dis; cnt++; root[r2]=r1; } } if(cnt!=n) return -1; else return ans;}int main(){ int m,t,sum,ans,cnt; scanf("%d",&t); while(t--) { scanf("%d%d",&n,&m); for(int i=0;i<=n;i++) root[i]=i; for(int i=0;i<m;i++) { scanf("%d%d%d",&a[i].x,&a[i].y,&a[i].dis); a[i].flag=0; } sort(a,a+m,cmp); cnt=1; ans=0; for (int i=0;i<m;i++) { int r1=findroot(a[i].x); int r2=findroot(a[i].y); if(r1!=r2) { a[i].flag=1; ans+=a[i].dis; cnt++; root[r2]=r1; } } int flag=0; for (int i=0;i<m;i++) { if(a[i].flag==0) continue; sum=0; for (int j=0;j<=n;j++) root[j]=j; sum=kruskal(i,m); if(sum==ans) { flag = 1; break; } } if(flag) printf("Not Unique!\n"); else printf("%d\n",ans); } return 0;}
阅读全文
0 0
- The Unique MST 2017 暑期 学习 次小生成树
- 次小生成树的学习 POJ1679 The Unique MST
- [次小生成树]The Unique MST
- The Unique MST-次小生成树
- poj 1679 - The Unique MST ( 次小生成树 )
- PKU 1679 The Unique MST 【图论】【 次小生成树】
- 1679 The Unique MST //次小生成树
- POJ 1679 The Unique MST 次小生成树Prim
- POJ 1679 The Unique MST 次小生成树
- Kruskal次小生成树 :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(次小生成树&Kruskal)
- poj 1679 The Unique MST 次小生成树算法
- 在win10 中excel vba 无法直接使用ddl声明的函数,如无法使用mouse_event事件
- Unity吃豆人项目解析
- iOS常见的几种加密方法
- tinyxml源码解析
- PHP验证码实现
- The Unique MST 2017 暑期 学习 次小生成树
- spring学习之@ModelAttribute运用详解
- Javascript实现找不同色块的游戏
- 389. Find the Difference注意异或运算的巧妙使用^
- datatables
- Linux基础教程1
- UVA
- hibernate-7-缓存的初步了解
- Dagger2使用(四)一个简单的Dagger依赖注入过程