用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