如图1所示， 、 为路网中任意两个互相连接的节点，其正向连接序号为 ，

如图1所示， 、 为路网中任意两个互相连接的节点，其正向连接序号为 ，黑色粗实线组成的封闭图形为交通路径网中的“块”，浅色粗实线表示节点 到各个块的最优路径。若节点 在节点 到各个块的最优路径上，则该有向节点对最优标志为真。

結果 (英文) 1:

As shown in Figure 1, and for any two connected nodes in the network, the positive connection number, black thick solid line closed for traffic path network consisting of "blocks", light thick solid line represents the optimal path nodes to each block. If each node in the node through the optimal path, then the node for the best flag is true.

結果 (英文) 2:

Shown, for any two network nodes connected to each other, the positive number is connected as a closed graphic black thick solid line consisting of the traffic route network in the "block", light-colored thick solid line indicates node to the optimal path for each block. If the node to a node on the optimal path for each block, the optimal node pair with the flag is true.

結果 (英文) 3:

As shown in Figure 1, two connected to each other, for any node in the network, positive sequence, closed graph black thick lines for the traffic path network in the "block", light solid line represent nodes optimal path to each block. If the nodes in a node to the optimal path of each block, the to the nodes on the optimal flag is true.