• 协议提出了基于最小成本路径数据转发法运用于簇内路由中。

    A data delivery based on the minimum cost routing which apply in the cluster is proposed.

    youdao

  • 校准对应着沿图表箭头左上角单元右下角单元格最小成本路径

    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.

    youdao

  • 深度优先搜索作为基本算法,路径删除结点删除方法产生多重最小成本求出优解。

    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.

    youdao

  • 深度优先搜索作为基本算法,路径删除结点删除方法产生多重最小成本求出优解。

    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.

    youdao

$firstVoiceSent
- 来自原声例句
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定