最小生成树lingo程序实现

model:sets:cities/1..10/:level;link(cities,cities):distance,x;endsetsdata:distance=08591214121617228091516811181422590791171212179157031710715151216930810615151481117809148161211710109086111618127614801111171412151586110102222171515161111100;enddatan=@size(cities);min=@sum(link(i,j)|i#ne#j:distance(i,j)*x(i,j));@sum(cities(i)|i#gt#1:x(1,i))=1;@for(cities(i)|i#gt#1:@sum(cities(j)|j#ne#i:x(j,i))=1;@for(cities(j)|j#gt#1#and#j#ne#i:level(j)=level(i)+x(i,j)-(n-2)*(1-x(i,j))+(n-3)*x(j,i););@bnd(1,level(i),999999);level(i)=n-1-(n-2)*x(1,i););@for(link:@bin(x));end