带权的二分图的最优匹配KM算法(二)
result = 0;
for(int i = 0; i < ny; i++)
{
if(linky[i]>-1)
result += w[linky[i]][i];
}
return result;
}
int main()
{ www.2cto.com
//freopen("C:\\Users\\Administrator\\Desktop\\kd.txt","r",stdin);
while(~scanf("%d%d",&nx,&ny))
{
if(!nx||!ny)
break;
int a,b,c;
while(scanf("%d%d%d",&a,&b,&c),a+b+c)
{
w[a][b]=c;
}
printf("%d\n",KM());
}
return 0;
}