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.

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

youdao

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.

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

youdao