欢迎访问铁路通信信号工程技术,今天是 English

铁路通信信号工程技术 ›› 2024, Vol. 21 ›› Issue (3): 7-11.DOI: 10.3969/j.issn.1673-4440.2024.03.002

• • 上一篇    下一篇

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

刘儒琛,孙众人,张尚崇   

  1. 兰州交通大学,兰州 730070
  • 收稿日期:2023-09-11 修回日期:2024-03-02 出版日期:2024-03-25 发布日期:2024-03-25
  • 作者简介:刘儒琛(1999—),男,硕士,主要研究方向:交通运输系统管理与优化,邮箱:448087909@qq.com。

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

Liu Ruchen,  Sun Zhongren,  Zhang Shangchong   

  1. Lanzhou Jiaotong University, Lanzhou    730070, China
  • Received:2023-09-11 Revised:2024-03-02 Online:2024-03-25 Published:2024-03-25

摘要: 为解决传统联锁表结构的站场数据修改繁琐,利用联锁表搜索进路效率低的问题,提高联锁系统数据存储便利性和车站进路搜索效率,设计一种采用邻接表结构的站场图模型,并在此基础上利用改进的深度优先搜索算法建立新的进路搜索模型。基于邻接表的站场图模型可以降低站场数据维护难度,配合改进的深度优先搜索算法可以提高进路搜索效率。

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

Abstract: This paper intends to solve the problems of cumbersome modification of station data in the traditional interlocking table structure and low efficiency in route search based on interlocking table, and to improve the convenience of data storage in the interlocking system and the efficiency 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 first search algorithm. The proposed station model based on adjacency list can reduce the difficulty of station data maintenance, and improve the efficiency of route search when used together with an improved depth first search algorithm.

Key words: station model, adjacency list, route search, depth first search

中图分类号: