MATALB 复杂网络最短路径及最短距离Dijkstra算法源码

1. function [distance,path]=Dijkstra(W,s,d)
2. %20190117 by Asterghost,in Beijing
3. N=length(W)；
4. for i=1:N
5.     W(i,find(W(i,:)==0))=inf；
6.     W(i,i)=0;
7. end
8. short_path_val=1./zeros(1,N)；
9. pre_dot=zeros(1,N)；
10. neighbor=W(s,:);
11. neighbor(s)=inf; 
12. short_path_val(s)=0; 
13. dot=zeros(1,N);
14. dot(:,:)=s;  
15. while sum(neighbor(:,:)~=inf)
16.     
17.     [xx,x]=min(neighbor);  
18.     x=x(1);
19.     neighbor(x)=inf;  
20.     
21.     short_path_val(x)=xx;
22.     pre_dot(x)=dot(x); 
23.     
24.     val_copy=xx+W(x,:); 
25.     yy=find(short_path_val==inf);
26.     y=find(val_copy<neighbor); 
27.     y1=intersect(y,yy); 
28.     neighbor(y1)=val_copy(y1);
29.     dot(y1)=x;
30.