用此算法对路网上101个车站(其中35个大型编组站和66个路网叉点站)、302个路段以及多组数据进行计算，均取得很好结果。

By the algorithm we get beneficial results for the wagon path problems with 101 stations (where 35 large marshalling yards and 66 crossing stations) and 302 tracks and many groups of data.

youdao

接着分析了联锁表的数据组织结构，并以玉剑车站为例重点阐述了以二叉树型站场数据结构自动生成联锁表的原理和实现方法。

Then the dissertation analyzes the structure of the interlock relation table, and it expatiates the principium and realization method of interlocking table 'automatic generation.

youdao

接着分析了联锁表的数据组织结构，并以玉剑车站为例重点阐述了以二叉树型站场数据结构自动生成联锁表的原理和实现方法。

Then the dissertation analyzes the structure of the interlock relation table, and it expatiates the principium and realization method of interlocking table 'automatic generation.

youdao