Dijkstra-matlab

代码说明：

  求第一个城市到其它城市的最短路径.用矩阵（为顶点个数）存放各边权的邻接矩阵，行向量、、、分别用来存放标号信息、标号顶点顺序、标号顶点索引、最短通路的值(The first city to find the shortest path to other cities. With a matrix (for the number of vertices) records of the right side of the adjacency matrix, row vector, were used to store label information and label the vertex order, label the vertex indexes, the shortest pathway value)