基于二叉树结构高速铁路联锁系统设计与实现

计算机联锁系统的进路搜索算法需要有更高的可靠性、安全性以及更快的搜索效率，才能满足高速铁路联锁系统的要求。针对这一需求，采用二叉树结构的进路搜索算法设计高速铁路的计算机联锁系统。基于二叉树的计算机联锁系统，其关键部分就是要将信号平面布置图上的信号点建立成二叉树模型。二叉树模型与站场形状有一定的相似性，在设备间的关系上，二叉树模型的结点与站场的联锁设备一一对应。因此，通过站场的平面布置图很容易建立二叉树模型，为编写程序提供方便，同时二叉树的数据结构有利于进路搜索，为选排进路提供了方便。

Binary tree structure based high-speed railway interlocking system

The route search of computer interlocking system needs to have higher safety and reliability as well as faster search efficiency, to meet the requirements of high-speed railway interlocking system. According to this requirement, the computer interlocking system of high-speed railway was designed by using the route searching algorithm of the binary tree structure. The key part of computer interlocking system that based on binary tree structure was to find signals in plane layout and use them build a binary tree. The mode of binary branch tree was similar to shape of station yard. Node of binary tree and the interlocking device of station were one-to-one correspondence on the relationship between the equipments. Therefore, it was easy to set up binary tree model according to the station yard layout. Binary tree model provides convenient to writing program, at the same time, to the benefit for route search.