Dijkstra

代码说明：

  该程序用Dijkstra算法寻找最小路径。输入为起点，终点，邻接矩阵。输出为最短距离，最短距离对应的路程。代码有详细注释说明。(The procedure used Dijkstra algorithm to find the minimum path. Enter as a starting point, end point adjacency matrix. The output is the shortest distance, shortest distance corresponds to the distance. Codes are detailed explanatory notes.)

文件列表：

Dijkstra.m,3488,2015-05-08