spanning tree

基本解釋

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)之間有且衹有一條通路，則搆成了一棵生成樹。即沒有網(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í)行一次生成樹協(xié)議（spanningtree protocol,STP），以生成一棵全新的生成樹，保証網(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è)公司是通過第二層機(jī)制（如生成樹）或第三層路由協(xié)議，獲得城域以太網(wǎng)的基本彈性。

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?

生成樹
The buget version of the MDMST problem is the Bounded Degree Minimum Spanning Tree （BDMST） problem.
帶度約束的最小生成樹（BDMST）問題是MDMST問題的預(yù)算版本。
支撐樹
According to the character of the problem, a DNA algorithm solving the Minimum Spanning Tree Problem is given.
根據(jù)問題的特征,提出了一個(gè)求解最小支撐樹問題的DNA算法。
分發(fā)樹
滙集樹
跨越樹
跨距樹

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