function?aver_path=aver_pathlength（A）
long=length（A）;
D=A;
D（find（D==0））=inf;
for?i=1:long
????D（ii）=0;
end
for?k=1:long
????for?i=1:long
????????for?j=1:long
????????????D（ij）=min（D（ij）D（ik）+D（kj））;
????????end
????end
end
?
?
?pathlength=0;
?aver_path=sum（sum（D））/（long*（long+1））;

?if?aver_path==inf
?????disp（‘該圖不是連通圖‘）;
?end
?
?
?????????

?屬性????????????大小?????日期????時間???名稱
-----------?---------??----------?-----??----

?????文件????????380??2011-04-28?20:27??復雜網絡\aver_pathlength.m

?????文件???????1912??2011-04-28?20:15??復雜網絡\ba_net.m

?????文件????????426??2011-04-29?18:33??復雜網絡\degree_distribution.m

?????文件???????1047??2011-04-28?21:07??復雜網絡\nw_net.m

?????文件???????1407??2011-04-28?20:20??復雜網絡\ws_net.m

?????目錄??????????0??2011-05-07?10:05??復雜網絡

-----------?---------??----------?-----??----

?????????????????5172????????????????????6