%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%% 該函數(shù)計(jì)算圖 點(diǎn)i到到點(diǎn)j的最短路徑
%%輸入：圖的鏈接矩陣；
%%輸出：距離矩陣
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

function [b] = Fun_Distance(Net);

N=size(Net,1); %%節(jié)點(diǎn)個(gè)數(shù)

%%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;