块节点分为内部节点和边界节点，节点 到块内部节点的最优路一定经过边界节

块节点分为内部节点和边界节点，节点 到块内部节点的最优路一定经过边界节点，因此节点 到块的最优路可以表示为节点 到所有边界节点的最优路。节点 到所有边界节点的最优路集合 如式（13）所示。

結果 (英文) 1:

Block node into internal node and edge nodes, node is the optimal block node must route through boundary nodes, so the node to the optimal path of all boundary nodes can be represented as a node to the optimal path. All boundary nodes of the node to the optimal set of roads such as equation (13) as shown.

結果 (英文) 2:

Block nodes and internal nodes are divided into boundary nodes, the node-to-node within a block boundary optimal path through a node, the node to the optimal path can be represented as a block boundary node to all nodes in the best way. The boundary node to all nodes in the set of optimal path as defined in formula (13) shown in Fig.

結果 (英文) 3:

Block nodes are divided into interior and boundary nodes, the node to the optimal path block internal node must through the boundary nodes, so the optimal path node to block can be expressed to the optimal way of all boundary nodes for nodes. Node to all optimal paths boundary node set as shown in formula (13).