floyd.m

佛洛依德算法的matlab实现

L=[0 2 1 inf inf
   2 0 inf 3 2
   1 inf 0 inf 4
  inf 3 inf 0 3
   0 2 4 3 inf];
shortest=zeros(5,5);
for i=1:5
    for j=1:5
        shortest(i,j)=L(i,j);
        path(i,j)=0;
    end
end
    for k=1:5
        for i=1:5
            for j=1:5
                if shortest(i,j)>(shortest(i,k)+shortest(k,j))
                    shortest(i,j)=shortest(i,k)+shortest(k,j);
					 path(i,j)=k;
					 path(j,i)=k;
                 end
             end
         end
     end
 end
 shortest