最小生成树

Prim

#include <cstdio>
#include <iostream>
#include <cstring>
using namespace std;

const int maxn = 112;
const int inf = 0x3f3f3f3f;
int data[maxn][maxn], n, m, dist[maxn];
bool vis[maxn];

void Prim() {
   int sum = 0, num = 1;
   for(int i = 1; i <= n; i++)
    dist[i] = data[1][i];

   while(num < n)
   {
       int Min = inf, v;
       for(int i = 1; i <= n; i++)
       {
           if(!vis[i] && dist[i] < Min)
           {
               Min = dist[i];
               v = i;
           }
       }
       vis[v] = true;
       sum += dist[v];
       num++;

       for(int i = 1; i <= n; i++)
       {
           if(!vis[i] && data[v][i] < dist[i])
            dist[i] = data[v][i];
       }
   }

   printf("%d\n", sum);

}
int main()
{
    while(~scanf("%d", &n) && n) {
        scanf("%d", &m);
        memset(data, inf, sizeof(data));
        memset(vis, false, sizeof(vis));
        for(int i = 0; i < m; i++)
        {
            int u, v, w;
            scanf("%d %d %d", &u, &v, &w);
            if(w < data[u][v])
            {
                data[u][v] = data[v][u] = w;
            }
        }

        vis[1] = true;
        Prim();
    }
}

并查集的那种

#include <cstdio>
#include <iostream>
#include <algorithm>
using namespace std;

int f[100];
struct node
{
    int u, v, w;
    bool operator <(const node &a) const {
        return w < a.w;
    }
}p[1123];

int getf(int u)
{
    if(u == f[u]) return u;
    return f[u] = getf(f[u]);
}

bool Merge(int u, int v)
{
    int t1 = getf(u);
    int t2 = getf(v);

    if(t1 != t2)
    {
        f[t2] = t1;
        return true;
    }
    return false;
}

int main()
{
    int n, m;
    while(~scanf("%d", &n)) {
            if(n == 0) break;
        scanf("%d", &m);
        for(int i = 0; i <= n; i++)
            f[i] = i;

        int cnt = 0;
        for(int i = 0; i < m; i++)
            scanf("%d %d %d", &p[i].u, &p[i].v, &p[i].w);
        sort(p, p + m);

        int sum = 0;
        for(int i = 0; i < m; i++)
        {
            if(cnt == n - 1) break;
            if(Merge(p[i].u, p[i].v)) {
                cnt++;
                sum += p[i].w;
            }
        }

        printf("%d\n", sum);
    }
}

次小生成树
题目链接
题目大意：给你一个有权值的无向图，判断最小生成树是否唯一。
整体思想就是，先得到MST。然后，我们可以在MST外选择一条边加入MST，这时，必然会形成一个环，那么我们就在MST上删去一条边（不能是加入的边），这样，我们就得到了另一个MST。如果这个MST的权值之和和原来的MST权值相同，就有多种构图形成MST。输出YES。

#include <cstdio>
#include <iostream>
#include <cstring>
using namespace std;

const int maxn = 112;
const int inf = 0x3f3f3f3f;
int data[maxn][maxn], n, m, dist[maxn], pre[maxn], Max[maxn][maxn];
bool vis[maxn], used[maxn][maxn];

int Prim()
{
   for(int i = 1; i <= n; i++)
   {
      dist[i] = data[1][i];
      pre[i] = 1;
   }


   int sum = 0, num = 1;
   dist[1] = 0, vis[1] = true, pre[1] = 0;

   while(num < n)
   {
       int Min = inf, v;
       for(int i = 1; i <= n; i++)
       {
           if(!vis[i] && Min > dist[i])
           {
               Min = dist[i];
               v = i;
           }
       }

       num++;
       used[pre[v]][v] = used[v][pre[v]] = true;
     //  cout << num << ' ' << v << ' ' << dist[v] << endl;
       sum += dist[v];
       vis[v] = true;

       for(int i = 1; i <= n; i++)
       {
           if(vis[i]) Max[i][v] = Max[v][i] = max(dist[v], Max[i][pre[v]]);
           if(!vis[i] && dist[i] > data[v][i])
           {
               dist[i] = data[v][i];
               pre[i] = v;
           }
       }
   }
   return sum;
}

int smst(int min_ans)
{
    int ans = inf;
    for(int i = 1; i <= n; i++)
    {
        for(int j = i + 1; j <= n; j++)
        {
            if(data[i][j] != inf && !used[i][j])
            {
                ans = min(ans, min_ans + data[i][j] - Max[i][j]);
            }
        }
    }

    if(ans == inf) return -1;
    return ans;
}

void solve()
{
    int ans = Prim();
    if(ans == -1)
    {
        printf("Not Unique!\n");
        return ;
    }

    int ans1 = smst(ans);
    if(ans == ans1)
    {
        printf("Not Unique!\n");
        return ;
    }
    printf("%d\n", ans);
}

int main()
{
    int t;
    scanf("%d", &t);
    while(t--)
    {
        int u, v, w;
        scanf("%d %d", &n, &m);
        memset(data, inf, sizeof(data));
        memset(Max, 0, sizeof(Max));
        memset(vis, false, sizeof(vis));
        memset(used, false, sizeof(used));
        for(int i = 0; i < m; i++)
        {
            scanf("%d %d %d", &u, &v, &w);
            if(w < data[u][v])
                data[u][v] = data[v][u] = w;
        }

        solve();
    }
}