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

例句与用法

Concretely we discuss the application of the shortest path problem , traveling salesman problerm and project management method on the touring itinerary improvement of travel agency . furthermore , we explore the use of minimum spanning tree problem , overlaid problerm and maximum flow problerm on the touring itinerary improvement of scenic spots . and also enclosed detailed spreadsheet solutions
具体的，讨论了最短路问题、旅行商问题和排程问题在旅行社线路优化中的应用；讨论了最小支撑树问题、覆盖问题和最大流问题在旅游景区线路优化中的运用，并在附录中给出了详细的电子表格解法。
By analyzing the topology of an interconnected power system , chapter 3 of this thesis derives the spanning tree , and builds the corresponding minimal cut set . by combining the results from the graph theory with the reliability indices of the individual reparable components , the reliability indices at the load point can be obtained , and the reliability indices for the whole system are deduced
本文的第三章从单个可修复元件的可靠性指标出发，在分析电网络的拓扑结构的基础上，利用一定的算法求出其对应的生成树，根据生成树和最小割集之间的对应关系，得到整个电网络的最小割集。
Topics covered include : randomized computation ; data structures ( hash tables , skip lists ) ; graph algorithms ( minimum spanning trees , shortest paths , minimum cuts ) ; geometric algorithms ( convex hulls , linear programming in fixed or arbitrary dimension ) ; approximate counting ; parallel algorithms ; online algorithms ; derandomization techniques ; and tools for probabilistic analysis of algorithms
主题包括?随机计算、资料结构（杂凑表、省略串列）、图论演算法（最小扩张树，最短路径，最少切割）、几何演算法（凸壳、在固定或任意维度的线性规划) 、近似计数、平行演算法、线上演算法、消去随机技术，以及演算法的机率分析工具。
This is improved in the nmst algorithm . the steps of constructing nmst are : firstly , construct the derived image which is generated according original image ; secondly , construct minimum spanning tree of derived image ; at last , construct spanning tree of original image by adding edges to the minimum spanning tree of derived image
针对最小生成树算法计算量大的缺点，构造近最小生成树算法，近最小生成树算法通过生成抽样图的最小生成树，通过图的扩展得到原始图像的近最小生成树，将其作为预测树对超光谱图像进行去相关处理。
Our simulation shows that the path will not be improved obviously with the further increase of k , when it reaches a certain value . in addition to this , the dissertation shows that when rh = 3 and rh = 4 , the results are similar . 2 . in regard to the application layer routing of tree - based p2p multicast , the dissertation presents a new kind model of spanning tree , named dcmd , in which the path delay , the
2 .在基于树的p2p组通讯的传输路径方面,抽象了一个新的生成树问题? ? dcmd问题,该问题同时考虑了线路延迟、主机的发送/转发延迟和每个主机的工作负载有限三种情况,可以更加全面地刻画出构建在应用层的p2p组通讯;证明了这个问题属于np - hard ;提出了基于最大度和基于最长路径两类启发式算法作为解决该问题的途径。

更多例句： 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.

详细百科解释