第8讲 最短路问题实.pptVIP

w=[ ]; function [l,z]=Dijkstra(W)n = size (W,1);for i = 1 :n ??? l(i)=W(1,i);??? z(i)=1;end i=1;while i=n??? for j =1 :n???????  if l(i)l(j)+W(j,i)??????????? l(i)=l(j)+W(j,i);??????????? z(i)=j;??????????? if ji??????????????? i=j-1;??????????? end??????? end??? end??? i=i+1;end  a=[ ]; n=size(a,1); D=a; path=zeros(n,n); for i=1:n ?? for j=1:n ?????? if D(i,j)~=inf ?????????? path(i,j)=j; %j是i的后续点 ?????? end ?? end end for k=1:n ?? for i=1:n ????? for j=1:n ???????? if D(i,j)D(i,k)+D(k,j) ??????????? D(i,j)=D(i,k)+D(k,j);??????????? path(i,j)=path(i,k); ???????? end ?????