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
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!
思路(暴力):
1、标记存在相同权值的边。
2、求最小生成树。
3、求得结果后,如果树中未包含做了标记的边,即可判断唯一;如果包含做了标记的边,则依次去掉这些边再求MST,如果求得的值和原来的值一样,即可判断MST不唯一。
代码:
#include <stdio.h>
#include <string.h>
#include <algorithm>
using namespace std;
const int maxn = 100 + 10, maxm = 100 * 100 + 100;
struct node
{
int x, y, v;
bool vis;
bool use;
bool operator < (const node &s) const
{
return v < s.v;
}
} w[maxm];
int f[maxn];
bool flag;
int find(int x)
{
return x == f[x] ? x : f[x] = find(f[x]);
}
bool merge(node no)
{
int x = find(no.x);
int y = find(no.y);
if(x != y)
{
f[x] = y;
if(no.vis == true)
flag = 1;
return true;
}
return false;
}
int main()
{
int T, n, m, sum;
scanf("%d", &T);
while(T--)
{
flag = sum = 0;
for(int i = 0; i < maxn; i++)
{
f[i] = i;
w[i].use = w[i].vis = false;
}
scanf("%d%d", &n, &m);
for(int i = 0; i < m; i++)
scanf("%d%d%d", &w[i].x, &w[i].y, &w[i].v);
sort(w, w + m);
for(int i = 1; i < m; i++)
if(w[i].v == w[i-1].v)
w[i].vis = w[i-1].vis = 1;
for(int i = 0; i < m; i++)
if(merge(w[i]))
{
sum += w[i].v;
if(w[i].vis)
w[i].use = true;
}
if(!flag)
printf("%d\n", sum);
else
{
bool tflag = false;
for(int i = 0; i < m; i++)
{
if(!w[i].use) continue;
int tsum = 0;
for(int j = 0; j < maxn; j++)
f[j] = j;
for(int j = 0; j <m; j++)
{
if(i != j && merge(w[j]))
{
tsum += w[j].v;
}
}
if(tsum == sum)
{
tflag = true;
break;
}
}
if(tflag) printf("Not Unique!\n");
else printf("%d\n", sum);
}
}
return 0;
}