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.
如果任意两点之间有且只有一条通路,则构成了一棵生成树。 即没有网络节点是孤立的。 - 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.
如果有一个活动链接失效了,就再执行一次生成树协议(spanningtree protocol,STP),以生成一棵全新的生成树,保证网络继续运行。 - 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.
传统上,各个公司是通过第二层机制(如生成树)或第三层路由协议,获得城域以太网的基本弹性。 - 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?
双语例句
权威例句
词组短语
- minimum spanning hyper -tree 最小生成超树
- minimum spanning 1 -tree 最小生成
- heuristic spanning - tree 启发式生成树圈覆盖
- internal spanning -tree 运行独立的生成树
- spanning -tree portfast 速端口;配置速端口;连接服务器端口设为速端口
短语
专业释义
- 生成树
The buget version of the MDMST problem is the Bounded Degree Minimum Spanning Tree (BDMST) problem.
带度约束的最小生成树(BDMST)问题是MDMST问题的预算版本。 - 支撑树
According to the character of the problem, a DNA algorithm solving the Minimum Spanning Tree Problem is given.
根据问题的特征,提出了一个求解最小支撑树问题的DNA算法。 - 分发树
- 汇集树
- 跨越树
- 跨距树
- 生成树
Spanning tree algorithm is adopted to direct search process of Ant Colony Algorithm.
采用生成树算法来指导蚁群算法的搜索过程。 - 支撑树
- 生成树
- 天生树
- 最大树生成树