基于邻接表和改进深度搜索的进路搜索研究  

Research on Route Search Based on Adjacency List and Improved Depth First Search

作　　者：刘儒琛 孙众人 张尚崇 Liu Ruchen;Sun Zhongren;Zhang Shangchong(Lanzhou Jiaotong University,Lanzhou 730070,China)

机构地区：[1]兰州交通大学,兰州730070

出　　处：《铁路通信信号工程技术》2024年第3期7-11,共5页Railway Signalling & Communication Engineering

摘　　要：为解决传统联锁表结构的站场数据修改繁琐,利用联锁表搜索进路效率低的问题,提高联锁系统数据存储便利性和车站进路搜索效率,设计一种采用邻接表结构的站场图模型,并在此基础上利用改进的深度优先搜索算法建立新的进路搜索模型。基于邻接表的站场图模型可以降低站场数据维护难度,配合改进的深度优先搜索算法可以提高进路搜索效率。This paper intends to solve the problems of cumbersome modifi cation of station data in the traditional interlocking table structure and low effi ciency in route search based on interlocking table,and to improve the convenience of data storage in the interlocking system and the effi ciency of station route search.It presents a station model using an adjacency list structure,and on this basis,a new route search model using an improved depth fi rst search algorithm.The proposed station model based on adjacency list can reduce the diffi culty of station data maintenance,and improve the effi ciency of route search when used together with an improved depth fi rst search algorithm.

关 键 词：站场图模型 邻接表 进路搜索 深度优先搜索 

分 类 号：U284.3[交通运输工程—交通信息工程及控制]