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)的效率，采用遗传算法求解。
应用推荐