摘要
本文提出了网络中一边长度改变的最短路算法，适合于大型网络中一边或几条边长度改变后各点对之间最短路的校正计算。
In this paper,a new algorithm is presented to determine the shortest paths in a network in which some link or some links are changed.The algorithm takes less CPU time and internal memory than the other algorithms existed, so mag be used in transportation planning of large scale networks.
出处
《系统工程理论与实践》
EI
CSCD
北大核心
1995年第3期26-31,共6页
Systems Engineering-Theory & Practice
关键词
最短路径
网络
算法
运输规划
shortest path
network
algorithm
transportation planning
