| 摘要 |
<p><P>PROBLEM TO BE SOLVED: To provide a route search method and a route search program capable of finding a route not including a cheat on the fare in a network having stations as nodes and expressing a route between stations and transfer on foot with arcs. <P>SOLUTION: The network having stations as nodes and expressing a route between stations and transfer on foot with arcs is 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 shortest paths are searched based on the shortest path tree (S106). In this case, it is determined whether a cheat on the fare is included or not relative to each determined shortest path candidate (S105). Then, a plurality of shortest routes are found (S107), and a time is allocated to the plurality of shortest routes (S108), and the fare is calculated (S109). A plurality of high-rank routs are selected and displayed based on a priority standard (S110). <P>COPYRIGHT: (C)2004,JPO</p> |
