最短路径算法是最优路径算法中的一个经典问题，它在实际生产生活中有广泛应用。
The shortest path algorithm is a classical problem of the best route algorithm, which has widespread application in many aspects.
在最短路算法和传统的绝对中心点模型的基础上介绍了一种利用最小距离矩阵和最优路径矩阵求取绝对中心点的算法。
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.
该文基于最优化方法中的复形法，对多智能体领域里的机器人足球避障问题，给出了最短路径的解决方法。
This paper gives the method of the shortest path for obstacle avoidance of robot soccer in the multigent system based on the method of complex of optimization.
本文采用最短路径算法解决产品的最优拆卸路径的选择问题，产品拆卸众多提供源时的拆卸路径问题。
There is a shortest path algorithm to select optimal disassembly path of product and find disassembly path of product with multi-supply-source.
讨论了一种地理信息系统空间分析算法——最短路径分析，然后利用最短路径结果，采用表上作业法将灾害救援物资进行优化，给出最优调运方案。
Then it optimized the rescue supplies using form operation method based on the result of the shortest path, and selected the optimal transportation scheme.
最短路径问题是网络分析中最基本的问题，它作为许多领域中选择最优问题的基础，在交通网络分析系统中占有重要地位。
As the base of optimal selection problem in many fields, computing shortest paths over a network has become an important task in many transportation and network analyses systems.
Dijkstra算法能得出最短路径的最优解，但由于它遍历计算的节点很多，所以效率低。
Dijkstra shortest path algorithm can arrive at the optimal solution, but because of its calculation of the node traversal, so inefficient.
Dijkstra算法能得出最短路径的最优解，但由于它遍历计算的节点很多，所以效率低。
Dijkstra shortest path algorithm can arrive at the optimal solution, but because of its calculation of the node traversal, so inefficient.
应用推荐