http://poj.org/problem?id=1679
判断图的最小生成树是否唯一,用次小生成树与最小生成树是否相等判断
对于最小生成树mst,在其中加入一条不属于mst的边,会出现环,我们删掉其中最长的边。对于枚举所以不属于mst的边后删掉环的最长边的结果的最小值既是次小生成树的答案
#include <iostream>
#include <algorithm>
#include <cstdlib>
#include <cstdio>
#include <cstring>
#include <vector>
#include <string>
using namespace std;
const int inf = 0x3f3f3f3f;
const int maxn = 100 + 3;
int G[maxn][maxn], f[maxn][maxn], n;
void prim() {
int p[maxn], vis[maxn], sum, k, v;
memset(vis, 0, sizeof(vis));
memset(f, 0, sizeof(f));
k = 0;
p[k++] = 1;
vis[1] = 1;
sum = 0;
for(int t = 1; t < n; t++) {
int min = inf;
int s, e;
for(int j = 0; j < k; j++) {
v = p[j];
for(int i =