节点文献
铁路网络两顶点间最短路径定向搜索算法
Directional Searching Algorithm for Finding Shortest Path between Two Vertexes in Railway Network
【摘要】 提出以Dijkstra算法为基础的铁路网络两顶点间最短路径的一种定向搜索算法。算法利用阈值作为搜索约束,可大大提高计算速度。该方法已试用于全国铁路网上最短路径的计算,取得良好效果
【Abstract】 In this paper,the directional searching algorithm for finding the shortest path between two vertexes in network is proposed.Calculation can be speeded up by using the formal threshold as searching restrain.This method has been used for calculating the railway freight charges,and satisfactory effect has been gained.
- 【文献出处】 铁道学报 ,JOURNAL OF THE CHINA RAILWAY SOCIETY , 编辑部邮箱 ,1997年02期
- 【分类号】F530
- 【被引频次】29
- 【下载频次】326