The modi-matrix method of solving the shortest path can be used to solve the optimal problems of a discrete control system.
解决最短路优化问题的摹矩阵方法可用于解决一类离散控制系统的最优控制问题。
The efficiency of the algorithm is discussed for solving the shortest path in network and the result shows that it has capability to get an excellent efficiency.
通过对网络最短距离问题运算效率的分析，表明该算法具有理想的运算效率。
This paper discusses algorithms of the shortest path in a weighted graph as well as the shortest path transformations resulted from it, and gives a simple program solving problem of MATLAB.
讨论了一个带权图的最短路径的算法及其若干个变形问题的算法，并在MATLAB软件环境下对最短路径问题给出了一个简捷易懂的程序。
Experimental results show that the weighted identification S-graph shortest path algorithm for solving the transport network is an effective method for the shortest path.
结果表明，加权标识s -图最短路径算法能够更有效地求解交通网络最短路径。
On the progressive formation of a tree, the algorithm of solving a shortest path problem is raised in which a matrix computation is imitated.
依据树的逐步生成原理，仿照矩阵运算，提出了求解捷径问题的生成树算法。
On the progressive formation of a tree, the algorithm of solving a shortest path problem is raised in which a matrix computation is imitated.
依据树的逐步生成原理，仿照矩阵运算，提出了求解捷径问题的生成树算法。
应用推荐