什么网站做推广好,百度搜索 手机,如何制作一个公司网页,网站升级维护需要多久function [d,path]floyd(a,sp,ep)% floyd - 最短路问题%% Syntax: [d,path]floyd(a,sp,ep)%% Inputs:% a - 距离矩阵是指i到j之间的距离#xff0c;可以是有向的% sp - 起点的标号% ep - 终点的标号%% Outputs:% d - 最短路的距离% path - 最短路的…function [d,path]floyd(a,sp,ep)% floyd - 最短路问题%% Syntax: [d,path]floyd(a,sp,ep)%% Inputs:% a - 距离矩阵是指i到j之间的距离可以是有向的% sp - 起点的标号% ep - 终点的标号%% Outputs:% d - 最短路的距离% path - 最短路的路径%% Example:% a [% 0 50 Inf 40 25 10 ;% 50 0 15 20 Inf 25 ;% Inf 15 0 10 20 Inf ;% 40 20 10 0 10 25 ;% 25 Inf 20 10 0 55 ;% 10 25 Inf 25 55 0 ];% [d,path]floyd(a,2,5)%%% Other m-files required: none% Subfunctions: none% MAT-files required: none%% See also: OTHER_FUNCTION_NAME1, OTHER_FUNCTION_NAME2% Author: Xiaoyong Ren%Packaging Engineering, Xian University of Technology .% email :horlabsohu.com% QQ: 170071606% December 2004; Last revision: 24-May-2005%------------- BEGIN CODE --------------nsize(a,1);Da;pathzeros(n,n);for i1:nfor j1:nif D(i,j)~infpath(i,j)j; %j是i的后续点endendendfor k1:nfor i1:nfor j1:nif D(i,j)D(i,k)D(k,j)D(i,j)D(i,k)D(k,j);path(i,j)path(i,k);endendendendp[sp];mpsp;for k1:nif mp~epdpath(mp,ep);p[p,d];mpd;endenddD(sp,ep);pathp;%------------- END OF CODE --------------
