then bridges find a spanning tree.
最后由网桥支撑起的一棵生成树
At this point Spanning tree has fully converged.
这时生成树成功聚合。
Study on the Problem of Constrained Minimum Spanning Tree.
约束最小生成树问题研究。
The player number decreasing minimum cost spanning tree game.
局中人数目变化的最小费用支撑树对策问题。
The most common cause of this condition is spanning tree loops.
出现上面情况，大多是由于生成树环引起的。
There might be a disaster in a large scale switching LAN without spanning tree protocol.
如果没有生成树协议，可能会给网络带来灾难性后果。
Apply the standard tools of VGC mechanism design to solve the minimum spanning tree problem.
文中将机制设计的标准工具VGC机制应用到解决最小支撑树问题。
A root bridge is elected as the root of the spanning-tree topology.
生成树拓扑内的网桥共同选举出根网桥。
What if the spanning-tree mode was different?
如果生成树模式不同会怎样？
When the network has stabilized, it has converged and there is one spanning-tree per network.
当网路已经稳定，它已经收敛并且每个网路有一个扩充树。
This topology is the spanning-tree of the network.
这种拓扑是扩充树的网路。
This topology is the spanning-tree of the network.
这种拓扑是扩充树的网路。
应用推荐