生成树算法 meaning in English
spanning tree algorithm
Examples
- Minimum spanning tree algorithm based on extended double list storage structure
基于扩展双链式存储结构的最小生成树算法 - The application and analyze about the algorithm of minimum spanning tree in multi - join
最小生成树算法在多元连接中的应用及算法分析 - At the same time , a fast heuristic algorithm of mimimum cost tree with delay constraint are presented , its time complexity is ( pn2 )
同时还提出了一种满足延迟约束的多播最小生成树算法（时间复杂度为( pn2 ) ） 。 - Most of the spanning tree algorithm ( sta ) failures occur due to the excessive loss of bpdus causing the blocked ports to transition to forwarding mode
大多的生成树算法( sta )失败发生由于过多的丢失bpdu导致阻塞端口转换为转发模式。 - It introduces the architecture of the switch , hol , delay control , vlan and spanning - tree algorithm , and crossbar backplane and store - and - forward technology
介绍了线头阻塞、时延控制、虚拟局域网和生成树算法等概念以及交换机的交换矩阵和共享存储器等关键技术。