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

Table 2

The possible path for a trip from Guangzhou to Liuzhou.

Node	Arrival time	Departure time	Route used at arrival	Fare (yuan)
13	9:30	9:33
21	11:25	11:27	Line 3	185.0
23	14:55	14:55	Line 3
24	14:56	14:56	Walk
26	14:59	—	Line 4	1.0