The fuzzy shortest path problem on a network appears in many applications. It is significant to research into it.
模糊最短路问题在许多领域有着广泛的应用，研究这一问题具有重要意义。
This paper gives a character of the network with no negative cycles, and an algorithm for the shortest path lengths in the network as well.
揭示了无负回路网络的性质，并给出了这种网络最短路长度的一种算法。
A genetic algorithmic approach to the shortest path (SP) routing problem in large network was presented in order to improve the efficiency of computation.
为提高求解大型网络最短路问题(SP)的效率，采用遗传算法求解。
And in the transportation network of the shortest route between two cities in is a typical example of the shortest path problem.
而在交通路网中两个城市之间的最短行车路线就是最短路径问题的一个典型例子。
To make the solution be implemented reliably in real time, a neural network for shortest path computation that is a two-layer recurrent structure is applied to flow deviation method.
为使问题的解能实时、可靠地完成，将一种用于最短路径计算的双层递归神经网络应用于路由选择的流量导数法中。
In order to solve the intelligent transportation system in transportation network analysis and the shortest path problem, this paper proposes a weighted identification S-graph shortest path algorithm.
为解决智能交通系统中交通运输网络分析和最短路径问题，提出加权标识s -图最短路径算法。
Classical shortest-circuit path algorithms is a basic of the transportation network analysis system, which has already got the extensive research in theoretic.
经典的最短路径算法是交通网络分析系统的一个基本算法，在理论上已经得到了广泛深入的研究。
Classical shortest-circuit path algorithms is a basic of the transportation network analysis system, which has already got the extensive research in theoretic.
经典的最短路径算法是交通网络分析系统的一个基本算法，在理论上已经得到了广泛深入的研究。
应用推荐