Three Extensions of Tong and Richardson’s Algorithm for Finding the Optimal Path in Schedule-Based Railway Networks

Table 7

The possible path using Tong and Richardson’s algorithm in Example  2.

Node	Arrival time	Departure time	Route used at arrival	Fare (yuan)
17	9:30	9:35		74.5
15	9:52	9:54	Line 1
13	10:11	10:23	Line 1
11	11:48	11:50	Line 2	314
9	12:23	12:25	Line 2
3	13:05	—	Line 2