| 摘要 |
PURPOSE:To determine automatically an optimum route between a start station and an arrival station, when these stations have been designated, by executing an addition and a rearrangement of a data, based on a result of storage of a memory which has stored in advance which station or which branch exists in both ends of the branch, together with a length of each branch. CONSTITUTION:Together with a length of each branch, which station or which branch exists in both its ends is stored in advance in a memory, a distance to an arrival point is added by connecting suitably the start end and the terminal of each branch, and also the shortest one of a result of this addition is used as a data. A computer generates an arrangement order data by rearranging each station and a junction in order being near from a station ST1, based on a distance data to each station and the junction in case the station ST1 has been set as a start point. Next, a result of calculation to the same station and the same junction is added (a total of the shortest distances). |
