| 摘要 |
In a method of determining minimal length routes through a network comprising nodes and links, the data defining the nodes and links is divided into two levels of nodes and links, the first higher level being used to determine the major portion of the route. Lower level nodes are attached to a specified point of one or more higher level links. If a start or finish point of a route is in the lower level set, the route is completed by adding the start and/or finish node to the first set together with the links from that node to all the nodes in the first set to which it is connected. This minimizes the time needed to generate the route due to the lower number of nodes and links which have to be examined in order to generate the route. |
