Research Article

Floyd-A Algorithm Solving the Least-Time Itinerary Planning Problem in Urban Scheduled Public Transport Network

Table 2

The changing labels of nodes associated with Figure 4.

Node Labels
Updated

Initialization OPEN202121nil *
NEW nil
NEW nil
NEW nil
NEW nil
NEW nil
NEW nil

1st searching round CLOSED202121nil *
OPEN 1211.523.5 *
OPEN25231.524.5 *
NEW nil
NEW nil
NEW nil
OPEN15131023 *

2nd searching round CLOSED202121nil
OPEN141211.523.5
OPEN25231.524.5
OPEN 14923 *
NEW nil
NEW nil
CLOSED15131023 *

3rd searching round CLOSED202121nil
OPEN 1211.523.5 *
OPEN25231.524.5
CLOSED1614923 *
OPEN3028028 *
NEW nil
CLOSED15131023

The node to be COLSED in the next searching round; The node whose labels are updated in the searching round.