floyd.m

来自「floyd算法、求各点的之间的最短路与最短距离」· M 代码 · 共 21 行

function [D,R] = floyd(a)
%FLOYD Summary of this function goes here
%  Detailed explanation goes here
n=size(a,1);
D=a;

for i=1:n
    for j=1:n
        R(i,j)=j;
    end
end
for k=1:n
    for i=1:n
        for j=1:n
            if D(i,k)+D(k,j)<D(i,j)
                D(i,j)= D(i,k)+D(k,j);
                 R(i,j)=k;
             end
         end
     end
 end