马新宇 Ma Xinyu 

（武汉铁路桥梁职业学院，武汉 430090）

（Wuhan Railway Bridge Vocational College，Wuhan  430090，China)

摘要：对车站站场图的遍历大多是通过将站场中各个设备的连接方式转换成站场拓扑模型，并将车站设备抽象分为图中节点存储。这样进路的搜索问题就转换成了在图中搜索路径的问题。本文以计算机图论为基础，建立基于铁路站场结构的拓扑模型，结合站场实际情况与图的深度优先搜索算法思路，提出一种基于邻接矩阵的连续遍历站场的算法，提高了遍历效率。 

Abstract: The traversal of the railway yard diagram is mostly done by converting the connection of each device in the station yard into a topological model of the station yard and abstracting the station devices into nodes stored in the diagram. In this way, the search problem of approach is converted into the problem of searching paths in the graph. In this paper, based on computer graph theory, we establish a topological model based on the structure of railway yards, combine the actual situation of station yards with the idea of depth-first search algorithm of graphs, and propose an algorithm based on adjacency matrix for successive traversal of station yards, which improves the traversal efficiency.

关键词：邻接矩阵；有向图；站场遍历；深度优先搜索算法；拓扑模型

Key words:Adjacency matrix; directed graph; traversing of railway yard ; depth-first search algorithm; topological model