文件名称:New-Text-Document-(2)
介绍说明－－下载内容均来自于网络，请自行研究使用
用Dijkstra算法求单源最短路径
输入参量ma是距离矩阵
输出参量是一个三行n列矩阵，每列表示顶点号及顶点到源的最短距离和前顶点-With a single-source Dijkstra shortest path algorithm for getting the input parameter ma is the output parameter from the matrix is a matrix of three rows of n columns, each column represents the vertex number and the shortest distance to the source vertex and the previous vertex
输入参量ma是距离矩阵
输出参量是一个三行n列矩阵，每列表示顶点号及顶点到源的最短距离和前顶点-With a single-source Dijkstra shortest path algorithm for getting the input parameter ma is the output parameter from the matrix is a matrix of three rows of n columns, each column represents the vertex number and the shortest distance to the source vertex and the previous vertex
(系统自动生成,下载前可以参看下载内容)
下载文件列表
New Text Document (2).txt