文件名称:ShortestPath
介绍说明－－下载内容均来自于网络，请自行研究使用
迪杰斯特拉算法求解最小路径，只用给出节点信息以及邻接矩阵即可求出节点对间最短路径，最短路径存于元胞内。文件中有测试的数据，可以替换。-Dijkstra algorithm minimum path, and the only information given node adjacency matrix you can find the shortest path between nodes, the shortest path within the cellular memory. File has test data, it can be replaced.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
ShortestPath\all_paths.asv
............\all_paths.m
............\result\roadmat.mat
............\......\roadmat1.mat
............\......\testparent\parent_10_17.mat
............\......\..........\parent_11_17.mat
............\......\..........\parent_12_17.mat
............\......\..........\parent_13_17.mat
............\......\..........\parent_14_17.mat
............\......\..........\parent_15_17.mat
............\......\..........\parent_16_17.mat
............\......\..........\parent_17_17.mat
............\......\..........\parent_18_17.mat
............\......\..........\parent_19_17.mat
............\......\..........\parent_1_17.mat
............\......\..........\parent_20_17.mat
............\......\..........\parent_2_17.mat
............\......\..........\parent_3_17.mat
............\......\..........\parent_4_17.mat
............\......\..........\parent_5_17.mat
............\......\..........\parent_6_17.mat
............\......\..........\parent_7_17.mat
............\......\..........\parent_8_17.mat
............\......\..........\parent_9_17.mat
............\source\20nodesData.mat
............\......\Adj.mat
............\......\nodeData.mat
............\test_allpaths.asv
............\test_allpaths.m
............\result\testparent
............\result
............\source
ShortestPath