bellman-ford中文

• 距離又叫
• 又叫

• bellman:    n. 貝爾曼〔姓氏〕。
• ford:    n. 淺灘，津渡，可涉水而過的地方。 ...
• bellman ford:    距離又叫

例句與用法

1. Unfortunately , the problem of finding multicast routing with qos constrained is a np - complete problem . so we can not solve the problem with the classical shortest path first algorithms such as bellman - ford and dijstra
   然而研究表明，由于qos組播路由帶有多個qos約束參數，因此qos組播路由問題是一個np完全問題，這使得它與傳統的路由過程不同，難以用經典的最短路徑優先算法求解。
2. The thesis then studies the emulation modes of routing algorithms with inaccurate network state information , proposes a simulation model based on events for routing algorithms with inaccurate network state information , and develops a routing simulation software r - ns that provides an effective environment for the research of network routing algorithms . randomized routing algorithms based on improved dijkstra and bellman - ford algorithms are proposed for the unicast routing model with inaccurate network state information
   本文研究了非精確網絡狀態信息的路由算法模擬仿真方法，提出了非精確網絡狀態信息下基于事件的網絡路由模擬仿真模型，設計并實現了路由模擬仿真軟件rns ，對網絡路由算法的研究提供了很好的支撐環境。