| 双向广度搜索算法在联锁进路自动生成中的应用 |
| |
| 引用本文： | 高利民,李文慧,孙慧.双向广度搜索算法在联锁进路自动生成中的应用[J].铁路计算机应用,2007,16(5):43-45. |
| |
| 作者姓名： | 高利民 李文慧 孙慧 |
| |
| 作者单位： | 兰州交通大学,光电技术与智能控制教育部重点实验室,兰州,730070 |
| |
| 摘 要： | 通过深入研究站场平面图的拓扑结构并与图的结构比较,在基于图搜索路径算法的基础上,运用一种改进的图的双向广度优先搜索算法来寻找基于邻接表存储的站场平面图的进路的搜索,并结合在实际进路搜索的过程,分析改进的算法的复杂度,进而总结出一种简洁效率的搜索进路方法.
|
| 关 键 词： | 计算机联锁 图 进路搜索 广度优先 队列 |
| 文章编号： | 1005-8451（2007）05-0043-03 |
| 收稿时间： | 2007-05-15 |
| 修稿时间： | 2006-09-24 |
Application of bidirectionalspan searched algorithm to automatic generating of interlocked path |
| |
| GAO Li-min,LI Wen-hui,SUN Hui.Application of bidirectionalspan searched algorithm to automatic generating of interlocked path[J].Railway Computer Application,2007,16(5):43-45. |
| |
| Authors: | GAO Li-min LI Wen-hui SUN Hui |
| |
| Institution: | Key Laboratory of Opto-electronic Technology and Intelligent Control, Lanzhou Jiaotong University, Ministry of Education, Lanzhou 730070,China |
| |
| Abstract: | By deeply studying on the topology of field plane figure and comparing with figure structure, based on arithmatic of figure paths searched, it was used bidirectional span and prior searching arithmatic of improved figure to look for path searched of field plane figure on consecutive table to store,and combined process of actual path serached, analysed complexity of improved arithmetic and consequently summed up method of compact and effective path searched. |
| |
| Keywords: | computer interlocking figure path searched span priority queue |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《铁路计算机应用》浏览原始摘要信息 |
| 点击此处可从《铁路计算机应用》下载免费的PDF全文 |
