公开(公告)号：US6061626A

公开(公告)日：2000-05-09

申请号：US841911

申请日：1997-04-17

Applicant: Christopher N. Meredith

Inventor： Christopher N. Meredith

IPC: G08G1/0968 ,  H04L12/701 ,  G06F15/50

CPC classification number: H04L45/00 ,  G08G1/0968

Abstract: 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.

Abstract translation: 在通过包括节点和链路的网络确定最小长度路由的方法中，定义节点和链路的数据被划分为两级节点和链路，第一较高级别用于确定路由的主要部分。 较低级节点附加到一个或多个更高级别链接的指定点。 如果路由的开始或结束点处于较低级别，则路由通​​过将起始和/或完成节点与从该节点到第一组中的所有节点一起添加到第一集合而完成， 它是连接的。 由于为了生成路由而必须检查的节点和链路数量较少，因此最小化生成路由所需的时间。