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软件环境下对最短路径问题给出了一个简捷易懂的程序。
应用推荐