求网络中全部最短路的径路延伸算法  

Extending Path Algorithm of all Shortest Paths on Network

作　　者：谢金宝[1] 

机构地区：[1]兰州交通大学交通运输学院,甘肃兰州730070

出　　处：《兰州交通大学学报》2009年第6期109-111,共3页Journal of Lanzhou Jiaotong University

摘　　要：在分析已有最短路问题研究成果的基础上,提出了最小最短路网络的概念,给出了求网络上始点到所有顶点间全部最短路的径路延伸算法以及最小最短路网络、最小最短路树的算法.通过算例,验证了算法的可行性.算法简便,易于理解.Based on analyzing the existing research results of the shortest part,the concept of the minimum shortest path network is put forward.The extending path algorithm of all shortest paths from the original node to the other nodes on network and the algorithm of the minimum shortest path network and tree are presented.The case study carried out shows that the algorithm is feasible,simple and knowable.

关 键 词：运筹学 最短径路 径路延伸法 全部最短路 最小最短路树 

分 类 号：U113[交通运输工程] O157.5[理学—数学]