function?[?distance?path]?=?Dijk（?Wste?）??
%DIJK?Summary?of?this?function?goes?here??
%???W??權值矩陣???st?搜索的起點???e?搜索的終點??
n=length（W）;%節(jié)點數(shù)??
D?=?W（st:）;??
visit=?ones（1:n）;?visit（st）=0;??
parent?=?zeros（1n）;%記錄每個節(jié)點的上一個節(jié)點??
??
path?=[];??
??
for?i=1:n-1??
????temp?=?[];??
????%從起點出發(fā)，找最短距離的下一個點，每次不會重復原來的軌跡，設置visit判斷節(jié)點是否訪問??
????for?j=1:n??
???????if?visit（j）??
???????????temp?=[temp?D（j）];??
???????else??
???????????temp?=[temp?inf];??
???????end??
?????????
????end??
??????
????[valueindex]?=?min（temp）;??
?????
????visit（index）?=?0;??
??????
????%更新?如果經(jīng)過index節(jié)點，從起點到每個節(jié)點的路徑長度更小，則更新，記錄前趨節(jié)點，方便后面回溯循跡??
????for?k=1:n??
????????if?D（k）>D（index）+W（indexk）??
???????????D（k）?=?D（index）+W（indexk）;??
???????????parent（k）?=?index;??
????????end??
????end??
??????
?????
end??
??
distance?=?D（e）;%最短距離??
%回溯法??從尾部往前尋找搜索路徑??
t?=?e;??
while?t~=st?&&?t>0??
?path?=[tpath];??
??p=parent（t）;t=p;??
end??
path?=[stpath];%最短路徑??
??
??
end??

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

?????文件??????11837??2018-06-05?22:16??Path_AstarB\1.jpg

?????文件??????13124??2018-06-05?22:51??Path_AstarB\2.jpg

?????文件??????15302??2018-06-05?23:18??Path_AstarB\3.jpg

?????文件??????41879??2018-06-06?00:02??Path_AstarB\4.jpg

?????文件??????42116??2018-06-05?23:57??Path_AstarB\5.jpg

?????文件??????41757??2018-06-06?00:11??Path_AstarB\6.jpg

?????文件?????561666??2018-06-06?01:23??Path_AstarB\7.jpg

?????文件???????1118??2018-06-06?01:32??Path_AstarB\Dijk.m

?????文件???????6098??2018-06-06?02:25??Path_AstarB\Path_AstarB.m

?????文件?????579158??2018-06-06?01:32??Path_AstarB\捕獲.JPG

?????文件?????143555??2018-06-06?02:11??Path_AstarB\捕獲2.JPG

?????目錄??????????0??2018-06-06?02:35??Path_AstarB

?????文件????????977??2018-06-06?02:35??Path_AstarB\pathXY.log

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

??????????????1458587????????????????????13