生成树算法的英文

• spanning tree algorithm

• "生成"英文翻译    create; generate; produce
• "树"英文翻译    tree
• "算法"英文翻译    algorithm
• "生成树算法, 支撑树算法" 英文翻译 :    spanning tree algorithm
• "最小生成树算法" 英文翻译 :    minimal spanning tree algorithm
• "树算法" 英文翻译 :    tree algorithm
• "伸缩树算法" 英文翻译 :    spanning tree algorithm
• "找树算法" 英文翻译 :    tree finding algorithm
• "生成树" 英文翻译 :    generation tree; spanning tree
• "求最小树算法" 英文翻译 :    min-tree finding algorithm; mini-tree finding algorithm
• "跨越树(生成树)" 英文翻译 :    spanning tree
• "生成树, 支撑树" 英文翻译 :    spanning tree
• "生成树协议" 英文翻译 :    spanning-tree protocol; stp:spanning tree protocol; stspanning tree protocol
• "有向生成树" 英文翻译 :    directed spanning tree
• "自动生成树" 英文翻译 :    ast: automatic spanning tree
• "最小生成树" 英文翻译 :    minimal spanning tree; mst minimum spanning tree; spanning tree (mathematics)
• "最大树生成树" 英文翻译 :    maximal tree; spanning tree
• "深度优先生成树" 英文翻译 :    depth-first spanning tree
• "生成树协议操作" 英文翻译 :    spanning-tree protocol manipulation
• "最小代价生成树" 英文翻译 :    minimum cost spanning tree
• "最楔代价生成树" 英文翻译 :    minimumspanning tree
• "生成算法" 英文翻译 :    generating algorithm
• "结构生成算法" 英文翻译 :    structure-generation algorithm
• "生成矩阵算法" 英文翻译 :    generation matrix algorithm
• "算法生成程序" 英文翻译 :    algorithm generator

• 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
  介绍了线头阻塞、时延控制、虚拟局域网和生成树算法等概念以及交换机的交换矩阵和共享存储器等关键技术。
• The nmst is taken as prediction tree and is used to remove the correlation of hyperspectral image . compared with the mst algorithm , the construction speed of nmst is improved more than ten times
  近最小生成树算法与最小生成树算法相比，预测树的构造速度提高一个数量级以上，而压缩比降低了不到5 。
• ( 3 ) on the basis of the dimensioning principle of correctness , integrality , clearness and rationality , utilizing the modified spanning tree algorithm in graph theory to ascertain the non - functional dimensions , accomplish the dimensioning mode analysis of the part
  ( 3 )根据尺寸标注所要求的正确性、完整性、清晰性及合理性等原则，用改进了的图论中的生成树算法，确定出零件的非功能尺寸，完成零件尺寸标注模式的分析。
• Firstly , the connected end sets of the relay lines are got using the breadth first search algorithm and the connected relationship of wiring terms is got in the electrical circuit diagram according to different cad block structure of different element type . secondly , the appropriate specification of the relay element is chosen by using the equinoctial graph algorithm , and the panel layout diagram is generated automatically by the combining automatic layout and manual intervention . finally , the optimized path algorithm which passes each vertex in the completed non - directional graph once and only once is put forward , this algorithm and the prim minimum spanning tree algrotithm can generate the inner panel wiring diagram and terminal wiring diagram automatically
  首先,采用广度优先搜索算法查找电气原理图中的连通导线端点集,并根据不同类型的继电元件对应的cad图块结构的不同,得到电气原理图中元件接线端子之间的连接关系;其次,根据二分图匹配算法为电气原理图中继电元件选择合适的型号和规格,并采用人工干预和自动布置相结合的方法完成屏面布置图的自动生成;最后,提出了完全无向图中经过每个顶点一次且仅一次的优化路径算法,利用该算法和经过预处理的prim最小生成树算法自动生成屏内安装接线图和端子接线图。
• With applying dsst algorithm , mobile agent can solve the problem of selecting router . synthesizing advantages of centralized search engine and distributed search engine , through it that system obtains the best way that agents mobile does . after statistics analysis , the author gets the mathematic pattern that mobil agent clones right times
  利用idl语言定义了agent在多种平台上移动的接口，设计了一个符合maf规范的插件，实现agent在异种平台之间的移动；利用动态最小生成树算法解决移动agent的路由选择问题，综合集中式搜索和分布式搜索的特点，动态寻找出一条agent移动的最佳路线；通过统计分析得到移动agent克隆的数学模型，通过计算可以获得agent克隆个数的最佳值。
• This paper begins with analyzing current metro transport network . combined with ethernet work technologies , an innovative scheme has been proposed to solve transporting packet - service on metro transport network . in this scheme , the key technology is using stackable vlan to establish metro ethernet evc , and using " self - limited " protocols to manage layered metro ethernet network
  方案中采用了可堆叠式vlan ( stackablevlan )技术来建立城域以太网evc连接，提出并采用了“自限”的概念，改造了用于以太交换网络的传统生成树算法和传统gvrp协议，实现了网络设备的分层、分自治域管理。