| 摘要 |
<p><P>PROBLEM TO BE SOLVED: To provide a route search method capable of finding a well-balanced route utilizing airplane, Shinkansen, charged limited express, or accommodation train, in a network having spots as nodes and expressing a route between spots and transfer on foot with arcs. <P>SOLUTION: A plurality of networks having spots as nodes and classified in every group for expressing a route between spots and transfer on foot with arcs are produced (S101), and a retrieval condition is read (S102), and data necessary for retrieval are read (S103). Then, the shortest path tree is produced (S104), and a plurality of well-balanced shortest paths are searched by using the plurality of networks based on the shortest path tree (S105). Then, a plurality of shortest routes are found (S106), and a time is allocated to the plurality of shortest routes (S107), and the fare is calculated (S108). A plurality of high-rank routes are selected and displayed based on a priority standard. <P>COPYRIGHT: (C)2004,JPO</p> |
