片语

sh spanning-tree输出被省略

minimum spanning incoming tree最小支撑入树

heuristic spanning- tree启发式生成树圈覆盖

minimum spanning outgoing tree最小支撑出树

spanning g tree跨越树

internal spanning-tree运行独立的生成树

spanning-tree problem生成树问题

英汉例句

• the experiment results show that it is effective on solving degree- constrained minimum spanning tree problem.

  实验结果表明，这种用遗传算法解决度约束的最小生成树问题是有效的。

• based on the characteristics of the wireless sensor networks, a data aggregation scheme of minimum transmission cost spanning tree is designed.

  针对传感器网络的特点，提出了一种最小传输成本生成树的数据汇聚机制。

• the most common cause of this condition is spanning tree loops.

  出现上面情况，大多是由于生成树环引起的。

• according to the different characters of the parameters of six-meshes, the maximum weight spanning tree and star structures were adopted to compress them respectively.

  然后，根据六元组各参数特性对全相连图分别采用了最大生成树和改进的星型压缩算法进行线性压缩。

• 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），以生成一棵全新的生成树，保证网络继续运行。

• in order to lower the scale of the problem and shorten the running time of algorithm, we propose a problem-dividing method based on minimum spanning tree to solve the tsp.

  本文提出了一种基于最小生成树的tsp问题分块求解算法，以此达到降低问题的规模、缩短算法运行时间的目的。

• basing on the edge-negative association in uniform spanning tree , we construct a family of random spanning forests and random connected subgraphs on g which are edge-negative associated.

  基于g上均匀扩张树的边负相关性，我们构造g上的一族边负相关的非平凡随机扩张森林和随机连通子图。

• implement the rapid spanning tree protocol, as specified in clause 17.

  实现了17章规定的快速生成树协议。

• there might be a disaster in a large scale switching lan without spanning tree protocol.

  如果没有生成树协议，可能会给网络带来灾难性后果。

• at this point spanning tree has fully converged.

  这时生成树成功聚合。

• the player number decreasing minimum cost spanning tree game.

  局中人数目变化的最小费用支撑树对策问题。

• the knowledge consistency checker (kcc) was not able to build a spanning tree topology.

  知识一致性检查器（kcc）无法来建立跨越树拓扑。

• 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.

  传统上，各个公司是通过第二层机制（如生成树）或第三层路由协议，获得城域以太网的基本弹性。

• in this paper, a parthenogenetic algorithm for solving the degree-constrained minimum spanning tree problem is proposed.

  提出了求解度约束最小生成树问题的单亲遗传算法。

• this paper discusses how to solve degree- constrained minimum spanning tree problems by means of genetic algorithm and gives a relative algorithm .

  探讨了如何将遗传算法应用于度约束的最小生成树问题，并给出了相应的算法。

• the main achievements and contributions are as follows. 1. we propose a self-protected spanning tree based recovery scheme for the native ethernet solution to protect against any single failure.

  论文的主要创新成果和结论如下：1。针对全以太网的解决方案，提出了一种基于自保护生成树的快速故障恢复方案，能够实现对任意单故障的快速恢复。

• in this paper, considering the cost of the node degree, a generalized minimum spanning tree modal is presented.

  本文考虑到节点度的代价问题 ，提出了广义最小生成树的概念 ，并分析了最小生成树在实际应用中的局限性 。

• the integer program model of minimal spanning tree was built up by the concepts of root and level of node in lingo. there are particular notes to the difficulties of the model.

  本文利用树根和节点级数的概念，借助于lingo建立了求解最小生成树的整数规划模型，并对模型中的难点给出了详细的注释。

• the smallest connection problem is widely used in network optimization. the key of solution is to find a minimum spanning tree with rapid and effective algorithm.

  最小连接问题在网络优化中有广泛的应用，找到快速有效的算法来构造最小生成树是解决问题的关键。

• the fundamental circuits relative to a spanning tree is a basis of the circ subspace .

  与一生成树相关的基本圈是广义圈子空间的一个基底。

• 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.

  如果任意两点之间有且只有一条通路，则构成了一棵生成树。即没有网络节点是孤立的。