生成树

词组短语

spanning tree

与生成树相关的网络例句 [注：此内容来源于网络，仅供参考]

Each bridge group runs a separate Spanning Tree and is addressable using a unique IP address.

每一个桥组运行一个独立的生成树并且使用独一无二的 IP 地址可以找到。

The counting and the construction of spanning trees in a complete bipartite graph Km,n are presented.

介绍了完全二分图 K3，3的生成树的计数和构造。

In the architecture, the coding information of each bit plane can be obtained simultaneously.

在该编码结构中，空间定位生成树采用深度优先遍历方式，比特平面同时处理极大地提高了编码速度。

In the connected undirected graph with no right to seek a minimum cost spanning tree procedure.

详细说明：在连通的带无权无向图中寻找一个最小代价生成树的程序。

In particular, if T is a spanning tree of G, we shall call its complement T' a cotree.

如果T是G的一棵生成树，我们称它的补集 T'为一副树。

In this paper, firstly, not only the incidence matrix ,adjacent matrix, cycle matrix, cut-set matrix of an undirected graph are summarized, but also the close contact between a graph and its corresponding matrix are discussed ; secondly, many problems of a graph which are solved by analysing its matrix are listed as follows:1、The co-tree set of a graph is obtained by using its cycle-matrix ; 2、The branches of its spanning tree are given by using its cut-set matrix ; 3、By making use of the incidence matrix of a graph ,not only its vertex cut 、cut vertex 、isolated point and spanning tree can be obtained ,but also the two sides which are whether parallel or not can be judged ;4、By using their adjacent matrix ,the two graphes which are whether isomorphous or not can be judged; once more, there is a detailed introduction in view of special graph (for example: bigaritite graph ,regular graph and so on);last but not least, a graph method of calculating the N power of a matrix is given and the practical applications of the theorem for degree is indicated.

本文首先综述了无向图的关联矩阵，邻接矩阵，圈矩阵，割集矩阵以及图和它对应矩阵之间的关系；其次总结出了利用上述各类矩阵可以解决的图的若干问题：1、利用图的圈矩阵可以求其连枝集；2、利用图的割集矩阵可以求其生成树的树枝；3、利用图的关联矩阵不仅可以求其割点、点割集、连通度、孤立点和生成树，而且可以判断两条边是否平行；4、利用图的邻接矩阵可以判断两个图是否同构；再次，针对特殊图（例如：二分图、正则图等等）的邻接矩阵作了详细介绍；最后，得到了利用图计算矩阵的N次幂的方法，指出度数定理的实际应用。

Through the bar adjacent matrix which can reflect the character of the multiple joint-point bar and multiple joint, the curtailedkinematic chain can be obtained, then its breadth-first spanning tree and 3 basic loops are deduced.

利用能够反映多副杆和复铰特点的构件邻接矩阵，构造运动链的缩减运动链，进而得到缩减运动链的广度优先生成树和三个基本回路。

Object To investigate the effect of Angelica polysaccharide on the induction of chronic myelocytic leukemia cells into chronic myelocytic leukaemia dendritic cells.

目的 探讨当归多糖对慢性粒细胞白血病细胞诱导生成树突状细胞的影响。

For solving the scalable problem and getting optimization solution, we propose the GA-MWPL-DC-ST algorithm which aims at resolving minimum weighted path latency degree-constrained spanning tree based on the two layers ALM model.

本文在具有超节点的双层应用层组播模型基础上，提出了利用遗传算法构建出度受限最小带权路径延时生成树的生成算法GA-MWPL-DC-ST，利用该算法可在超节点上对双层组播树进行分布式构建，从而将求最优解问题的巨大计算量分担到多个超节点上。

It first builds aComplete-Generation-Tree on-line for each output that a user asks for; then it searches for an optimal valid Generation-Path for each output; after that it composes Generation-Paths to construct a coarse-grain composite service.

它首先为用户期望的每一个目标即时生成完备生成树，然后选取最优的有效生成路径，最后将生成路径合成为大粒度流程式组合服务。

与生成树相关的网络解释 [注：此内容来源于网络，仅供参考]

Broadcast Storm：广播风暴

欲达到备援的能力,首要的就是增加备用的线路,当然,在乙太网路的架构下,环状(Ring)或网状(Mesh)的架构是不备允釭满A那会形成网路的回路(Loop)并造成网路上广播风暴(Broadcast Storm)的发生,也因此在IT应用里有了生成树协议STP(Spanning Tree Protocol)的出现,

CIST Common and Internal Spanning Tree：总生成树

CHAP Challenge Handshake Authentication Protocol Challenge 握手鉴别协议 | CIST Common and Internal Spanning Tree 总生成树 | CoS Class of Service 服务类别

maximal tree：最大树生成树

maximal strip 极大带 | maximal tree 最大树生成树 | maximality 极大性

Prim：普里姆

(7)带权路径长度, 哈夫曼树(Huffman)的概念, 哈夫曼算法, 哈夫曼编码树. (4)生成树、最小生成树的概念;克鲁斯卡尔(Kruskal)算法, 普里姆(Prim)(4)哈希(Hash)表的查找: 哈希表的概念, 哈希函数的构造方法, 哈希表的

spanning tree：生成树

因为, 生成树(Spanning Tree)网络传输效率比较低,网络备份切换时间不小于45秒,远远不能满足用户对与时间敏感业务的要求. 然而,北电的SMLT技术克服了传统生成树算法的不足,在上连的两条网络带宽上均有负载,在一条线路出现问题时,

spanning tree：生成树协议

+ 生成树协议(Spanning Tree)定义在IEEE [[802.1D]]中,是一种链路管理协议,它为网络提供路径冗余同时防止产生环路. 为使以太网更好地工作,两个工作站之间只能有一条活动路径. 网络环路的发生有多种原因,

Minimum Spanning Tree：最小生成树

给定一个连通无向图G,且它的每条边均有相应的权值,则图G的最小生成树(Minimum Spanning Tree)是指生成树中边的权值之和最小的一棵生成树.

spanning tree algorithm：生成树算法

自动 自动 自动 自动 已禁用1) VLAN的划分方法有哪些(abc )11) 以下关于MAC地址的说法中正确的是(abc )12) 生成树算法(Spanning Tree Algorithm) 通过将导致循环连接的端口设置为阻塞状态, 来保证网络拓扑中没有环路存在:(t)

Spanning Tree Protocol：生成树协议

而运行透明桥接的CISCO路由器,使用"生成树协议"(SPANNING TREE PROTOCOL)可以很好地避免桥接引起的播送风暴. 生成树协议通过"桥接协议数据单元"(BRIDGE PROTOCOL DATA UNITS)定义了网络上各个桥接的通信形式,其逻辑结构就像一棵树,

maximum spanning tree：最大生成树

最小生成树:minimum cost spanning tree | 最大生成树:maximum spanning tree | 最小生成树:degree constrained minimum spanning tree