8.2 8.1 Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf 15.8 0 Inf Inf Inf Inf Inf Inf Inf
Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf 9.8 9.2 Inf Inf 4.1 10.1 Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf 0 Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf 11.8 14.5 Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf 7.2 5.5 Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf 0 Inf Inf Inf Inf Inf
Inf Inf Inf Inf 11.4 9.5 Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf 12 Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf 19.8 Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf 0 14.2 Inf Inf Inf
Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf 7.9 13.2 8.8 10.5 Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf 14.2 0 Inf Inf Inf
Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf 10.5 Inf 12.1 15.2 Inf Inf Inf Inf Inf Inf 10.1 Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf 0 Inf Inf
Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf 8.3 7.2 7.7 Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf 0 Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf 7.9 Inf 9.2 Inf Inf Inf Inf 12.9 8.8 Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf Inf 0 ]; c=1;
for i=1:size(a,1) for j=1:size(a,2) if a(i,j)<=100
w(c)=a(i,j);m(c)=i;n(c)=j;c=c+1; end end end
dg=sparse(m,n,w);
[d,p,pred]=graphshortestpath(dg,36,44); p
26
27
28