fun_distance.asv

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

ASV
27 行
字号
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%% 该函数计算图 点i到到点j的最短路径
%%输入:图的链接矩阵;
%%输出:距离矩阵
%%By Xiao Lp, 2007-07-06
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

function [b] = Fun_Distance(Net);

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

%%floyd 
b=Edge+Edge';
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;

⌨️ 快捷键说明

复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?