假定交通路径网中有 个节点，每个节点有 个正向连接，则计算路网中有向节

假定交通路径网中有 个节点，每个节点有 个正向连接，则计算路网中有向节点对到所有块的最优标志需要 次Dijkstra拓展，因此该拓展方法需要的时间过长，这里以块为基本处理单位，对块边界节点采用逆向Dijistra 拓展获取节点最优标志，只需拓展 次即可获得所有节点的最优标志

結果 (英文) 1:

Assumes that traffic path network in the has a node, each node has a are to connection, is calculation network in the has to node on to all block of optimal logo needs times Dijkstra expand, so the expand method needs of time had long, here to block for basic processing units, on block border node used reverse Dijistra expand gets node optimal logo, just expand times can obtained all node of optimal logo

結果 (英文) 2:

Assuming that there is a traffic route network nodes, each node has a positive connection, is calculated in the network node to all the blocks of the sub-optimal flag requires Dijkstra expansion, the time required is too long the expansion method, where block as the basic processing unit of a block boundary node node using reverse Dijistra get the best sign to expand just to expand times to get the best sign of all nodes

結果 (英文) 3:

Assume that the traffic route network has nodes, each node has a positive connection, then calculate the road network has to expand to all nodes on the optimal block symbols need to Dijkstra, so the extension method needs long time, here to block as the basic unit, on the block boundary nodes by reverse Dijistra expand the access node optimal symbol only time, expand all nodes can obtain optimal symbol