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 | | OPEN | 2 | 0 | 21 | 21 | nil | *√ | | NEW | | | | | nil | | | NEW | | | | | nil | | | NEW | | | | | nil | | | NEW | | | | | nil | | | NEW | | | | | nil | | | NEW | | | | | nil | |
| 1st searching round | | CLOSED | 2 | 0 | 21 | 21 | nil | * | | OPEN | | 12 | 11.5 | 23.5 | | * | | OPEN | 25 | 23 | 1.5 | 24.5 | | * | | NEW | | | | | nil | | | NEW | | | | | nil | | | NEW | | | | | nil | | | OPEN | 15 | 13 | 10 | 23 | | *√ |
| 2nd searching round | | CLOSED | 2 | 0 | 21 | 21 | nil | | | OPEN | 14 | 12 | 11.5 | 23.5 | | | | OPEN | 25 | 23 | 1.5 | 24.5 | | | | OPEN | | 14 | 9 | 23 | | *√ | | NEW | | | | | nil | | | NEW | | | | | nil | | | CLOSED | 15 | 13 | 10 | 23 | | * |
| 3rd searching round | | CLOSED | 2 | 0 | 21 | 21 | nil | | | OPEN | | 12 | 11.5 | 23.5 | | *√ | | OPEN | 25 | 23 | 1.5 | 24.5 | | | | CLOSED | 16 | 14 | 9 | 23 | | * | | OPEN | 30 | 28 | 0 | 28 | | * | | NEW | | | | | nil | | | CLOSED | 15 | 13 | 10 | 23 | | |
|
|
The node to be COLSED in the next searching round; The node whose labels are updated in the searching round.
|