计算 到所有块的最优标志，其节点对 对应的最优节点对标志集合为 。 为

计算 到所有块的最优标志，其节点对 对应的最优节点对标志集合为 。 为有向节点对通过正向连接 进入目标块 的节点最优标志，每个标志的大小为1位，节点最优标志按照块序号顺序排列， 为交通路径网中块的数量。节点最优标志的取值如式（12）所示。

結果 (英文) 1:

Calculate the best sign of all blocks, whose nodes correspond to the optimal node to flag collection. As directed is on via is optimal logo to connect to the target node, the size of each symbol is a 1-bit, optimal sign in block sequence node sequence, as the number of blocks in the route network. Node optimal value of the flags as formula (12) as shown.

結果 (英文) 2:

Calculate the optimal mark all blocks, its nodes corresponding optimal set of nodes for signs. To have a positive connection to the node through the nodes of the target block into the optimal flag, the size of each symbol is 1, the nodes are arranged in the optimum block number flag sequence is the number of blocks in the traffic route network. Optimal values ​​of the node flag formula (12) shown in Fig.

結果 (英文) 3:

To the best of all block symbol calculation, optimal node the node pair of corresponding symbol set for. As to the node to node optimal enter the target block through the forward connection symbol mark, each 1 bits in size, node optimal marks are arranged according to block serial number sequence, as the number of traffic route network block. The value node optimal signs such as shown in formula (12).