| 摘要 |
PROBLEM TO BE SOLVED: To accelerate the adjusting processing of a fare by extracting a crossing station where directions from a starting station, a through station and an arriving station are not coincident with each other as an adjusting object station. SOLUTION: All the stations on plural lines are grouped into G1 to G17. Directionality toward respective crossing stations A to E from the respective groups G1 to G17 are examined and numbers 1 to 4 given to lines to be connected to the respective stations A to E are listed to prepare a data table. For example, a number showing directionality toward a crossing station C from the group G1 is 2. When a commutation ticket is fed into an adjusting machine 1, data on the starting station, the through station and the arriving station is read to obtain the data table of a starting station (p) and an arriving station (q). The directionality of the respective stations A to E seen from the groups G1 and G15 of each are read to extract the crossing station of different directionality (different number) as the adjusting object station. |
