pta公路村村通 使用了kruskal算法 但可能prim算法更适合这道题后期还会更新

#include <bits/stdc++.h>
using namespace std;
const int maxn=1000;
struct Edge
{
     int u;
     int v;
     int price;

};
vector<struct Edge>ve;
int father[maxn];
int findfather(int x)
{
    if(x==father[x])
              return x;
    else
    {
         int F=findfather(father[x]);//一路找到底 然后把根赋值给每一个人前驱
         father[x]=F;
         return F;

    }
}
void Union(int a,int b)
{
     int fa=findfather(a);
       int fb=findfather(b);
       if(fa!=fb)
       {
              father[fa]=fb;
       }

}
int cmp(struct Edge a,struct Edge b)
{
       return a.price<b.price;
}
int main()
{
    int n,m,flag=0;
    cin>>n>>m;
    int cnt=0,sum=0;
    for(int i=1;i<=n;++i)
      father[i]=i;
    for(int i=0;i<m;++i)  //构造很多边
    {
        int a,b,c;
        cin>>a>>b>>c;
        struct Edge edge;
        edge.u=a;
        edge.v=b;
        edge.price=c;
        ve.push_back(edge);
    }
    sort(ve.begin(),ve.end(),cmp);
    for(int i=0;i<ve.size();++i)
    {
        int fa=findfather(ve[i].u);
        int fb=findfather(ve[i].v);
        if(fa!=fb)
        {
          Union(ve[i].u,ve[i].v);
          sum+=ve[i].price;
          cnt++;
        }
        if(cnt==n-1)
        {
               flag=1;
               break;
        }

    }
    if(flag)
    {
       cout<<sum;
    }
    else
       cout<<-1;
        return 0;
}

https://pintia.cn/problem-sets/15/problems/718