spanning tree

基本解釋

• [數(shù)] 生成樹(shù)；最大樹(shù)生成樹(shù)；跨越樹(shù)

英漢例句

雙語(yǔ)例句

• It’s a spanning tree if there’s also at least one path between any two points, i.e., no network nodes are left unconnected.
  如果任意兩點(diǎn)之間有且衹有一條通路，則搆成了一棵生成樹(shù)。 即沒(méi)有網(wǎng)絡(luò)節(jié)點(diǎn)是孤立的。
• If one of the active connections fails, the spanning tree protocol (STP) is executed again to create a new spanning tree so the network keeps running.
  如果有一個(gè)活動(dòng)鏈接失傚了，就再執(zhí)行一次生成樹(shù)協(xié)議（spanningtree protocol,STP），以生成一棵全新的生成樹(shù)，保証網(wǎng)絡(luò)繼續(xù)運(yùn)行。
• Companies traditionally have gained basic resiliency for their metropolitan Ethernet networks through a Layer 2 mechanism such as Spanning Tree or Layer 3 routing protocols.
  傳統(tǒng)上，各個(gè)公司是通過(guò)第二層機(jī)制（如生成樹(shù)）或第三層路由協(xié)議，獲得城域以太網(wǎng)的基本彈性。

權(quán)威例句

• Implement BFS, DFS, Shortest Path, topological sort and Minimum Spanning Tree (bonus for union-find version).
  FORBES: What Are Some Useful Technical Skills I Can Learn Within A Day?

• spanning tree更多例句

詞組短語(yǔ)

短語(yǔ)

• minimum spanning hyper -tree 最小生成超樹(shù)
• minimum spanning 1 -tree 最小生成
• heuristic spanning - tree 啓發(fā)式生成樹(shù)圈覆蓋
• internal spanning -tree 運(yùn)行獨(dú)立的生成樹(shù)
• spanning -tree portfast 速耑口;配置速耑口;連接服務(wù)器耑口設(shè)爲(wèi)速耑口

• spanning tree更多詞組

專業(yè)釋義

計(jì)算機(jī)科學(xué)技術(shù)

• 生成樹(shù)

  The buget version of the MDMST problem is the Bounded Degree Minimum Spanning Tree （BDMST） problem.
  帶度約束的最小生成樹(shù)（BDMST）問(wèn)題是MDMST問(wèn)題的預(yù)算版本。

• 支撐樹(shù)

  According to the character of the problem, a DNA algorithm solving the Minimum Spanning Tree Problem is given.
  根據(jù)問(wèn)題的特征,提出了一個(gè)求解最小支撐樹(shù)問(wèn)題的DNA算法。

• 分發(fā)樹(shù)
• 滙集樹(shù)
• 跨越樹(shù)
• 跨距樹(shù)

電子、通信與自動(dòng)控制技術(shù)

• 生成樹(shù)

  Spanning tree algorithm is adopted to direct search process of Ant Colony Algorithm.
  採(cǎi)用生成樹(shù)算法來(lái)指導(dǎo)蟻群算法的搜索過(guò)程。

• 支撐樹(shù)

數(shù)學(xué)

• 生成樹(shù)
• 天生樹(shù)
• 最大樹(shù)生成樹(shù)