Muti_Cost=zeros（CrossPointNoCrossPointNo）;
?????for?i=1:CrossPointNo
?????????[a?b]=ShortestPath_Djk（CostCrossPointNoi）;
?????????Muti_Cost（i:）=a
?????end

?屬性????????????大小?????日期????時間???名稱
-----------?---------??----------?-----??----
?????目錄???????????0??2013-07-14?16:08??最短路徑\
?????文件?????????164??2007-02-03?10:35??最短路徑\all.m
?????文件????????2008??2007-02-03?10:35??最短路徑\canshu.m
?????文件?????????607??2007-02-03?10:35??最短路徑\main.m
?????文件?????????873??2007-02-03?10:35??最短路徑\PrintPath.m
?????文件????????1888??2007-02-03?10:35??最短路徑\ShortestPath_Djk.m
?????文件?????????355??2007-02-03?10:35??最短路徑\說明.txt