分析:prim算法(添加边)
#include<cstdio>
#include<algorithm>
using namespace std;
struct Road
{
int x,y,vau;
}road[5000];
bool comp(const struct Road &A,const struct Road &B)
{
if(A.vau<B.vau)
return 1;
else
return 0;
}
int main()
{
int i,n,m,num,sum,x,y,t,KK;
int mark[110];
while(scanf("%d%d",&n,&m)&&n)
{
bool flag=0;
if(n<m-1)
flag=1;
for(i=0;i<n;i++)
{
scanf("%d%d%d",&x,&y,&num);
road[i].x=x;
road[i].y=y;
road[i].vau=num;
}
if(flag)
printf("?\n");
else
{
sort(road,road+n,comp);
for(i=1;i<=m;i++)
mark[i]=1;
mark[road[0].x]=0; sum=0; KK=0;
for(i=0;i<n;i++)
{
t=mark[road[i].x]+mark[road[i].y];
if(t==1)
{
sum+=road[i].vau;
mark[road[i].x]=mark[road[i].y]=0;
i=0;//每次从头开始找
KK++;
}
}
if(KK<m-1)//是否保证畅通
printf("?\n");
else
printf("%d\n",sum);
}
}
return 0;
}