Based on the shortest path problem and classical absolute center model, an algorithm of absolute center problem is discussed, by using the least distance matrix and the optimum path matrix.
在最短路算法和传统的绝对中心点模型的基础上介绍了一种利用最小距离矩阵和最优路径矩阵求取绝对中心点的算法。
On the progressive formation of a tree, the algorithm of solving a shortest path problem is raised in which a matrix computation is imitated.
依据树的逐步生成原理，仿照矩阵运算，提出了求解捷径问题的生成树算法。
Secondly, based on the shortest path algorithm, a public traffic network-transit matrix and a non-transfer matrix are introduced to design the public traffic transfer algorithm.
通过对多种现有算法的分析，利用公交换乘矩阵性质，本文提出了一种求解公交网络最优路径的标准算法。
应用推荐