摘要
在分析已有最短路问题研究成果的基础上,提出了最小最短路网络的概念,给出了求网络上始点到所有顶点间全部最短路的径路延伸算法以及最小最短路网络、最小最短路树的算法.通过算例,验证了算法的可行性.算法简便,易于理解.
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.
出处
《兰州交通大学学报》
CAS
2009年第6期109-111,共3页
Journal of Lanzhou Jiaotong University
关键词
运筹学
最短径路
径路延伸法
全部最短路
最小最短路树
operations research
the shortest path
extending path algorithm
all shortest paths
the minimum shortest path tree
