| 摘要 |
PROBLEM TO BE SOLVED: To efficiently search by giving a number to the node of each mesh formed by dividing a traffic network, giving adjoining mesh joint data to the node on a compartment side, and again searching for the route of the node shown by the joint data when the node changed to a permanent label is on the compartment side. SOLUTION: A traffic network is mesh-likely divided, and a node is let correspond to a specific point. A line connecting the nodes is expressed as a link, and when the link exceeds a mesh boundary, a node is set on the mesh compartment side and a number is given to each mesh. As to the node on a compartment side, adjoining mesh joint data given to the node on the compartment side of adjoining meshes is given. When a node changed to a permanent label is a node on a compartment side during processing route search by a label ascertaing method, for the node shown by the joint data, route search process is added again to be performed. In the joint data, it is described that which nodes of which meshes are the same. |
