| 摘要 |
PROBLEM TO BE SOLVED: To obtain the optimum route by researching by searching a new route with the point nearest the destination in a small area set on a guide route as a temporary destination. SOLUTION: Whether there is a joining node or not in a small area is discriminated according to whether a flag having no joining node is stood or not. If there is the node in the small area, searching the node as the destination is started in the small area. At this time, the switch of 'all route searching' is displayed on a display, and whether the switch is pressed or not is discriminated. If the switch is not pressed, whether the searching of the small area is finished or not is discriminated, and if it is not finished, the process is returned to the previous one. As long as the switch is not pressed, this loop is repeated until the small area searching is finished. When the small area searching is finished, whether a calculation failure occurs or not is discriminated. If it is not failed, the process is returned to the original route via the node based on the result of the small area searching, and the guide to the destination is started. |
