minimum delay spanning tree
基本解釋
- [計算機(jī)科學(xué)技術(shù)]最小延遲生成樹
英漢例句
- Focuses on the algorithms of the minimum-delay spanning tree for the application-layer multicast, and proposes an improved BCT-H(balance compact tree-heuristic) algorithms based on strategy function.
文中著重研究搆建最小延遲應(yīng)用層組播樹的算法,提出一種基於策略函數(shù)搆造應(yīng)用層最小直逕組播樹的啓發(fā)式算法BCT-H。
雙語例句
專業(yè)釋義
- 最小延遲生成樹