matlab编匈牙利算法怎么会出现死循环,求高手解释
clcload a.mat
a=[222.36 166.51 99.095 199.16 217.19 231.24 228.93 187.74 195.16 120.83 84.49 120.82 52.293
204.64 148.79 81.372 181.44 199.47 213.52 211.21 170.02 177.44 103.11 74.489 103.1 60.351
183.52 127.67 60.256 160.32 178.35 192.41 190.09 148.91 156.32 81.996 94.314 81.979 43.934
221.03 165.18 97.763 197.83 215.86 229.91 227.6 164.97 158.05 83.727 123.28 76.656 3.5
174.84 129.7 62.28 162.35 176.05 190.11 181.41 113.07 106.15 31.829 96.338 24.758 55.248
175.14 130 62.586 162.65 176.36 190.41 181.71 113.37 106.46 32.135 96.644 25.064 56.813
147.47 109.06 41.648 141.71 148.68 162.74 154.04 85.702 80.155 5.831 75.707 12.902 82.615
141.7 94.339 26.923 126.99 142.92 156.97 148.28 97.518 104.93 30.608 60.982 30.995 86.773
130.11 82.742 15.325 115.39 131.32 145.38 136.68 109.12 107.57 33.245 49.384 40.316 94.423
75.866 127.76 68.476 95.107 77.079 91.135 82.436 157.31 151.76 77.436 102.53 84.507 148.66
37.914 83.373 112.86 50.723 32.696 46.751 38.053 201.69 196.14 121.82 146.92 128.89 193.05
0 119.5 144.34 86.853 68.825 64.77 35.916 233.17 227.63 153.3 178.4 160.37 224.53
59.77 59.733 127.15 27.083 9.0554 5 23.854 243.44 237.89 163.57 161.21 170.64 228.41
119.5 0 67.417 32.65 50.677 64.733 83.587 191.86 189.22 114.9 101.48 121.97 168.68
185.65 144.34 76.923 176.99 186.87 200.92 192.23 47.518 57.005 44.015 110.98 51.086 120.8
144.34 67.417 0 100.07 118.09 132.15 150.91 124.44 121.8 47.479 34.059 54.55 101.26
226.98 150.05 82.637 182.7 200.73 214.79 233.55 195.93 203.35 129.02 48.578 129.01 78.205
242.47 186.62 119.2 219.27 237.3 251.35 249.04 207.85 215.27 140.94 95.511 140.93 72.403
225.47 169.61 102.2 202.26 220.29 234.35 232.04 190.85 198.26 123.94 102.07 123.92 55.397
269.46 213.61 146.19 246.26 264.29 278.34 276.03 232.81 223.49 149.17 120.84 142.09 64.489
]
b=a;
s=length(a);
ml=min(a')
for i=1:s
a(i,:)=a(i,:)-ml(i)
end
mr=min(a)
for j=1:s
a(:,j)=a(:,j)-mr(j)
end
num=0;
while(num~=s)
indes=ones(s);
indes=a&indes;
indes=~indes;
flag=zeros(s);
ans=zeros(s);
while(sum(sum(indes)))
for i=1:s
t=0;
l=0;
for j=1:s
if(flag(i,j)==0&&indes(i,j)==1)
l=l+1;
t=j;
end
end
if(l==1)
flag(:,t)=flag(:,t)+1;
indes(:,t)=0;
ans(i,t)=1;
end
end
for j=1:s
t=0;
r=0;
for i=1:s
if(flag(i,j)==0&&indes(i,j)==1)
r=r+1;
t=i;
end
end
if(r==1)
flag(t,:)=flag(t,:)+1;
indes(t,:)=0;
ans(t,j)=1;
end
end
end
num=sum(sum(ans));
if(s==num)
break
end
m=max(max(a))
for i=1:s
for j=1:s
if(flag(i,j)==0)
if(a(i,j)<m)
m=a(i,j);
end
end
end
end
for i=1:s
for j=1:s
if(flag(i,j)==0)
a(i,j)=a(i,j)-m;
end
if(flag(i,j)==2)
a(i,j)=a(i,j)+m;
end
end
end
end
zm=ans.*b
z=0
z=sum(sum(zm)) 百度文库上的吧，我也是死循环，我看了下感觉这个while(sum(sum(index)))这个循环有问题，没有考虑出现0的闭合回路。
并且按照它的算法，如果出现剩余未划线部分每行都是两个以上的0，也会死循环
唉，总之百度害人啊，我已经准备换google了
算法自身所带的BUG
页:
[1]