摘要
简述了计算机联锁系统中站场型数据结构的建立方法,通过深入研究站场型数据结构形状与二叉树的相似性,结合在实际搜索进路过程中总结的经验,提出了一种基于站场型数据结构的新的进路搜索算法。该算法是结合了二叉树、四叉链表和高度原则的新的进路搜索算法。详细论述了这种算法,并给出了完整的描述。
The paper outlines the method to build data structures of railway station yard layout in computer interlocking systems. Through studying the similarity of data structure of station yard layout and binary branch tree and combining experiences form practical manual route searching, a new route searching algorithm was brought forward, which combined binary branch tree, quadric link list, altitude principle. A complete particular description of the algorithm was given.
出处
《铁道通信信号》
2007年第4期4-6,共3页
Railway Signalling & Communication
关键词
计算机联锁
数据结构
二叉树
进路搜索
Computerized interlocking, Data structure, Binary branch tree, Route search
