The usual sequential shortest path algorithms executing on sequential computer have nearly reached their time complexity limits.
针对通常的串行计算机的串行最短路径算法，几乎已经到达了理论上的时间复杂度极限。
The paper applied genetic algorithms to the shortest path with characteristic of multiple phase decision-making, and proves the feasibility of the algorithms with an example.
本文应用遗传算法解决具有多阶段决策特点的最短路问题，对于较多顶点的此类最短路问题也有较好的应用。
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软件环境下对最短路径问题给出了一个简捷易懂的程序。
In this paper, we revise the graphical method by means of the Shortest path algorithm, and obtain two variants which are pseudo-polynomial algorithms.
本文利用最短路算法修订了图上作业法，得到了两个拟多项式算法。
Road networks are usually large scale and complicated networks. Therefore, general algorithms of shortest path are not appropriate because they require much computation time.
道路网络通常是大规模和复杂的网络，而一般的最短路径算法需要大量的计算时间。
In this dissertation, algorithms for generating multicast trees with a trade-off in delay and bandwidth consumption are investigated. The Ameliorated Shortest Path tree (ASPT) is proposed.
在本文中，探讨了平衡延迟和带宽消耗的算法，提出了改进的最短路径树算法(ASPT)。
The shortest path problem, in which label algorithms are of consequence, is a research topic in the field of geographic information science and computer science.
最短路径算法是计算机科学与地理信息科学领域的研究热点，而标号算法则是最短路径算法中的重要一族。
Most of the developed algorithms are based on the improvement to the shortest path finding algorithm, however, the algorithm is essentially unsuitable for querying transit network.
目前绝大多数公交查询算法是基于最短路径查找算法的改进，但最短路径算法本质上不适合公交线路的查询。
Especially when a longer path is being searched, the searching efficiency is much better than the traditional algorithms for shortest path.
尤其当搜索路径较长时，搜索效率明显优于传统最短路径算法。
Three algorithms are presented for computing the shortest path between two arbitrary points on a polyhedral surface: One is an approximate algorithm;
提出计算多面体面上任意两点之间最短路径的算法：近似算法、最短路径或近似最短路径算法。
Three algorithms are presented for computing the shortest path between two arbitrary points on a polyhedral surface: One is an approximate algorithm;
提出计算多面体面上任意两点之间最短路径的算法：近似算法、最短路径或近似最短路径算法。
应用推荐