| 摘要 |
PURPOSE:To retrieve the minimum path with a slight storage area even if there is a limit in the number of links, by using a specific path retrieval algorithm and performing the retrieval of reciprocating path from a start node to an end node with the limited link number. CONSTITUTION:First, label of the start node (s) is denoted as 0000. A node label is determined as to nodes c, a, t of a link rank 1 toward the node s. Next, the label is determined for the link rank 2, i.e., nodes a, d, b toward the nodes c, a, t. In case of the node (a), the new and old labels are compared, and when the number of link of the new label is large and the interval from the node (s) is short, the label is revised into the new one. The label is determined for the nodes e.t.b being the rank 3, and similar operations are performed. In case of the link rank 4, since the limit of the number of links is limited to 3, back tracing is performed. The label having the link number less by 1 is adopted, and the counter node is found out with the label, and the path is retrieved up to the node (s) and this path is adopted. |
