UVA 10462 - Is There A Second Way Left?

题意：求出图的最小生成树和次小生成树，存在三种情况，不存在最小生成树，存在最小生成树但不存在次小生成树，存在次小生成树，对应输出三种情况

题解：kruskal先求最小生成树，依次记录生成树的加入的边，再跑一次kruskal，和上一次不同的是，这次要跳过上次已经记录的边，然后看能否生成树就好了

代码

#include<cstdio>
#include<algorithm>
#define M 210
#define INF 0x3f3f3f3f

using namespace std;

struct node
{
    int u, v;
    int w;
}a[M];

int n, m;
int father[M];
int vis[M];

bool cmp(node A, node B)
{
    return A.w < B.w;
}

void init()
{
    for(int i = 1; i <= n; i++)
        father[i] = i;
}

int Find(int x)
{
    return father[x] != x ? father[x] = Find(father[x]) : x;
}

int main()
{
    int T;
    scanf("%d", &T);
    for(int t = 1; t <= T; t++)
    {
        scanf("%d %d", &n, &m);
        for(int i = 0 ; i < m; i++)
            scanf("%d %d %d", &a[i].u, &a[i].v, &a[i].w);
        printf("Case #%d : ", t);
        sort(a, a + m, cmp);
        init();
        int k = 0;
        int mst = 0;
        for(int i = 0; i < m; i++)
        {
            int x = Find(a[i].u);
            int y = Find(a[i].v);
            if(x != y)
            {
                father[y] = x;
                mst += a[i].w;
                k++;
                vis[k] = i;
            }

            if(k == n - 1)break;
        }
        if(k != n - 1)
        {
            printf("No way\n");
            continue;
        }
        int second_mst = INF;
        for(int i = 1; i <= k; i++)
        {
            init();
            int ans = 0, cnt = 0;
            for(int j = 0; j < m; j++)
            {
                if(j == vis[i])continue;
                int x = Find(a[j].u);
                int y = Find(a[j].v);
                if(x != y)
                {
                    father[y] = x;
                    cnt++;
                    ans += a[j].w;
                }
                if(cnt == n - 1)break;
            }
            if(cnt == n - 1)second_mst = min(second_mst, ans);
        }
        if(second_mst == INF)
        {
            printf("No second way\n");
            continue;
        }
        printf("%d\n", second_mst);
    }
    return 0;
}