网络中一边长度改变的最短路算法

尹良龙;顾保南

系统工程理论与实践 ›› 1995, Vol. 15 ›› Issue (3) : 26-31.

PDF(686 KB)
中国科学院数学与系统科学研究院期刊网
PDF(686 KB)
系统工程理论与实践 ›› 1995, Vol. 15 ›› Issue (3) : 26-31. DOI: 10.12011/1000-6788(1995)3-26
论文

网络中一边长度改变的最短路算法

    尹良龙, 顾保南
作者信息 +

An Algorithm to Finding the Shortest Path in a Changes Network

    Yin Lianglong, Gu Baonan
Author information +
文章历史 +

摘要

本文提出了网络中一边长度改变的最短路算法，适合于大型网络中一边或几条边长度改变后各点对之间最短路的校正计算。

Abstract

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.

关键词

最短路径 / 网络 / 算法 / 运输规划

Key words

shortest path / network / algorithm / transportation planning

引用本文

EndNote

Ris (Procite)

Bibtex

导出引用
尹良龙 , 顾保南. 网络中一边长度改变的最短路算法. 系统工程理论与实践, 1995, 15(3): 26-31 https://doi.org/10.12011/1000-6788(1995)3-26
Yin Lianglong , Gu Baonan. An Algorithm to Finding the Shortest Path in a Changes Network. Systems Engineering - Theory & Practice, 1995, 15(3): 26-31 https://doi.org/10.12011/1000-6788(1995)3-26
中图分类号： O22   
PDF(686 KB)

339

Accesses

0

Citation

Detail
段落导航
相关文章

/

〈 〉