ROUTE SEARCHING APPARATUS

摘要

PROBLEM TO BE SOLVED: To make it possible to select the route to the nearest facility without searching the facility from a map by outputting index data near the present position from the index data and automatically proposing the route to the facility. SOLUTION: Index data 25 records facility name 27 and position data 28 at each type 26 of the facility. The data 25 is called, and map display is conducted. Route searching data 29 records searching data at each hierarchy from a hierarchy '0' to wide hierarchy 'n' with a narrow district as an object. The searching data of each hierarchy has connecting node data 30, link presuming passage time (link cost) data 31 and route display data 32. The connecting node data 30 indicates to which node the node is connected. The data 31 indicates the cost of the link between the nodes. The route searching adds the link cost of all the routes from the present position node to the destination node, and selects the lowest route of the link cost.