基于邻接链表的车站道岔数据存储方法与实现

Station Turnout Data Storage Method and Implementation Based on Adjacency List

计算机技术已广泛应用于铁路信息化管理,传统的信号联锁设备大多都被计算机联锁取代.为利用计算机实现列车进路的自动选择,需要把联锁设备信息存储到计算机中,数据存储结构决定了信息系统的时间效率和空间效率.本文通过对车站站场信息进行分析,把车站站场转换成计算机所能表示的无向图拓扑结构,构建了邻接链表数据结构,设计了邻接链表的创建算法,实现了道岔等车站线路上信号联锁设备的自动存储.车站联锁设备采用邻接链表存储结构,可以为"最短路径"算法提供高效、可靠的数据.

Computer technolog has been widely used in the information management of railway. Most of traditional inter-locking signal devices are mostly replaced by the computer interlocking. In order to automatically, the information of interlocking device is needed to be stored in the computer. The space and time efficiency of tlie information system are determined by data storage structure. This article analyzes the station yard information. It transforms the station yard to undirected graph’s topological structure which can be expressed by computer. It realizes that the signal interlocking device on the line of rail station can be automatic stored by building the adjacency list data struc-ture, and designs the creation algoritlim of adjacency list . The interlocking signal device in stand reliable data to high-speed algorithm by using adjacency list storage structure.