fun_distance.m

来自「无标度网络的生成模型」· M 代码 · 共 26 行

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%% 该函数计算图 点i到到点j的最短路径
%%输入：图的链接矩阵；
%%输出：距离矩阵
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

function [b] = Fun_Distance(Net);

N=size(Net,1); %%节点个数

%%floyd 
b=Net+Net';
path=zeros(length(b));

for k=1:N
   for i=1:N
      for j=1:N
         if b(i,j)>b(i,k)+b(k,j)
            b(i,j)=b(i,k)+b(k,j);
            path(i,j)=k;
         end
      end
   end
end

b=b/2;