该协议提出了基于最小成本路径的数据转发法并运用于簇内路由中。
A data delivery based on the minimum cost routing which apply in the cluster is proposed.
校准对应着沿图表的箭头从左上角单元格到右下角单元格的最小成本路径。
Alignments correspond to minimum-cost paths from the top left-hand cell to the bottom right-hand cell that follow the arrows on the diagram.
以深度优先搜索作为基本算法，用路径删除和结点删除方法产生多重解，用最小成本法求出最优解。
Based on depth first search, the article USES route deletion and node deletion methods to produce multi-solutions, and then determine the optimum solution with least costing.
应用推荐