spanning tree中文是什么意思

发音:

中文翻译
造句

跨越树(生成树)
扫瞄树
生成树, 支撑树
最大树生成树

span span1 〔古语〕 spin 的过去式。
tree n. 1.树〔主要指乔木，也可指较大的灌木〕。 ★玫瑰可 ...
depth-first spanning tree 深度优先生成树
directed spanning tree 有向生成树
minimal spanning tree 最小生成树
minimal spanning tree algorithm 最小生成树算法
minimum cost spanning tree 最小代价生成树
minimum spanning tree 最小生成树
minimum(cost)spanning tree 最楔代价）生成树
mst minimum spanning tree 最小生成树
spanning tree (mathematics) 最小生成树
spanning tree algorithm 伸缩树法; 伸缩树算法; 生成树算法, 支撑树算法
spanning-tree protocol 生成树协议
spanning-tree protocol manipulation 生成树协议操作
tsts transparent spanning tree schema 透明生成树状轮廓图
spanning 分解; 跨越; 生成的; 斯潘宁; 斯蓬宁
boundary spanning 跨越管理
device spanning 设备跨越; 设备跨展
disk spanning 硬盘数据跨盘
linear spanning 线性生成
spanning airfoil 全跨度翼
spanning cluster 跨越集团
spanning equipment 渡河设备
spanning forest 生成森林
spanning rail 对接导轨

"查查词典"手机版

千万人都在用的超大词汇词典翻译APP

例句与用法

For solving the problem of finding the degree - constrained minimum spanning tree ( dcmst ) in network design and optimization , a heuristic search method is proposed , in which based on minimum spanning tree , degrees of vertices over the constrained degrees are reduced to the required state
摘要针对网络设计和优化中度约束最小生成树问题，提出了一种基于贪心思想的启发式算法求解度约束最小生成树。
In this protocol , based on the analyses of the existing clustering algorithms , a clustering algorithm with maximal residual energy is provided . a tree structure is constructed by the proposed algorithm so that the cluster - heads are on a spanning tree rooted at the sink
在协议中,通过分析已有的经典组簇算法,并结合代码分发的特点提出了一个最大剩余能量组簇算法,并基于簇结构提出了一个综合建树算法。
( 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 )根据尺寸标注所要求的正确性、完整性、清晰性及合理性等原则，用改进了的图论中的生成树算法，确定出零件的非功能尺寸，完成零件尺寸标注模式的分析。
This paper studies and introduces some principles and several methods of constructing de bruijn sequences , by generating spanning trees , or using cut - join method , or defining anoperator , or joining the cycles of the factor of gn . it presents some efficient algorithms to generate de bruijn sequences
本文从生成树法、算子法、剪接法及经典的并圈法等多角度探讨了debruijn序列的构造原理和方法，给出了生成debruijn序列的一些有效算法。
The software system is made up of several parts , including the embedded linux os , the switch ' s driver software , and some upper level protocol software such as the igmp snooping protocol , the asymmetric vlan management protocol and the spanning tree protocol
本文主要论述了基于以太网的社区宽带接入系统中，接入交换机软件系统的设计和实现，包括交换机底层驱动程序、组播和生成树等协议、 vlan配置管理以及交换机配置管理等功能的实现。
Aimed at the current problem of pipeline layout optimization technique , the research of irrigation pipeline layout and pipe diameter optimization has been done , the gis ( geography information system ) and graph theory were first put forwarded to applyed to the design of low pressure pipeline irrigation project in the paper . with the support of gis , the minimal spanning tree theory of graph theory and 120 project theory can be applied to irrigation pipeline ' s layout optimization . at the aspect of pipe diameter optimization , simplicial method and interior - point method are been used in solve liner optimization model of pipe diameter to reach minimum project cost or a nnual working cost of low pressure pipeline irrigation
本文主要针对当前南方地区低压管道输水灌溉规划设计中存在的技术难点，开发研究先进实用的树状低压输水灌溉管网计算机辅助设计系统。首次提出了将gis (地理信息系统)和图论技术应用于低压管道输水灌溉规划设计及灌溉管网优化中，在gis支持环境下，应用图论中的最小生成树法和120规划进行管道的最优化布置。建立以管道输水灌溉系统的年折算费用最小为目标函数的管径优化线性规划模型，并将内点法应用于线性优化模型的求解。
In this paper , a storage strategy and a query process method are presented , with the methods to represent and convert the query result . the storage model , which is composed of the reachability code of the two spanning trees and an efficient reachability index , can be used to determine the reachable relation between any two nodes in nearly constant time
本文提出了图模型xml数据上的一种存储策略,该存储模型由基于正向,反向两棵生成树的可达编码和一种高效的可达索引组成,利用它可以在很短的时间内判断图中任两点的可达关系。
The creativity of the work in the paper can be shown as the following four aspects : ( 1 ) for single subnet , the condition of simple link judgement is added into the ptda , so the algorithm is improved well ; ( 2 ) for multiple subnets , the ptda becomes more effective , benefited from use of breadth - first - search algorithm of graph , port - deletion method etc ; ( 3 ) due to suitable adoption of the three protocols stp , snmp and arp , the ptda based on spanning tree protocol can get very effective and correct ; ( 4 ) owing to the employment of ieee802 . 1 q , the ptda of vlan is all - purpose to some extent
本文的创新之处主要体现在以下四个方面:在单子网物理拓扑发现算法中,增加了判断简单连接的条件,使算法更加完善;在多子网物理拓扑发现算法中采用图的广度优先遍历方法、端口删除方法等,该算法更加有效;在生成树协议物理拓扑发现算法中,正确使用stp 、 snmp和arp三种协议,物理拓扑发现非常准确;在vlan物理拓扑发现算法中,正确运用了ieee802 . 1q协议,该算法具有通用性。
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最小生成树算法自动生成屏内安装接线图和端子接线图。
Different from other researches , autoore uses the proposed java semantic model as input data , and gives a tree - liked , hierarchical structured and semantic cluster set . the clustering method is based on a minimum spanning tree that represents the software system . the clustering objective function is designed according to the software modularization metric and cognition psychology theory
抽象是autoore的核心，它首次采用对象系统的语义关系抽取数据为输入，利用基于mst表示的、聚集目标结合了程序认知心理学理论的软件聚集方法，得到一个具有丰富语义的、组织为树状的、分层的聚集集合。

更多例句： 1 2 3 4 5

百科解释

In the mathematical field of graph theory, a spanning tree T of a connected, undirected graph G is a tree composed of all the vertices and some (or perhaps all) of the edges of G. Informally, a spanning tree of G is a selection of edges of G that form a tree spanning every vertex.

详细百科解释