There is a recursive formula for the number of spanning trees in a graph.
对于一个图的生成树的棵数，存在一个递推公式。
Calculates the distance in minimal spanning trees complete source code, has been tested.
计算距离最小生成树完整的源代码，已经过测试。
Spanning trees of graphs and bases of matroids are basic objects in combinatorial theory.
图的支撑树及拟阵的基都是组合理论的基本研究对象。
The relationship between bonds and cotrees is analogous to that between cycles and spanning trees.
键和余树之间的关系类似于圈和生成树之间的关系。
The example does not demonstrate how to configure spanning trees and switch priority for spanning trees that may be required.
这个示例并不演示如何配置跨越树及其所需的交换机优先级。
The relative importance of two groups of nodes in the graph can be compared with respect to the number of spanning trees.
通过比较生成树的数目，可以判断图中任意数目的两组节点的相对重要性。
The most vital nodes are those whose removal with their incident links most drastically decreases the number of spanning trees.
从图中去掉节点以及相关联的链路后，所得到的图对应的生成树数目越少，则表明该组节点越重要。
A realizable recursive algorism is proposed to search all the File Spanning Trees for a given program in the distributed system.
设计和实现了一种得到分布式程序的所有文件生成树的递归算法。
The number of spanning trees is an important invariant of a graph, it is also an important measure of the reliability of a network.
图的支撑树数是图的重要的不变量，也是网络可靠性的重要量度。
To enumerate all spanning trees in undirected graphs is an important problem that people frequently encounter in the analysis of network and cycle.
求无向图的生成树是在网络和回路分析中经常遇到的重要问题。
The graph theory is applied to get the corresponding constraints network graph, and the parts dimension modes are abstracted as spanning trees of the graph.
运用图论的知识来生成相应的约束网络图，进一步将零件的种种标注模式抽象为零件约束网络图的一棵棵生成树。
This method ranks the node importance over all nodes in a network. The relative importance of two nodes in a graph is compared in terms of the number of spanning trees.
该方法可以评价全网范围内的节点重要性，通过比较生成树的数目，可以判断通信网中任意两个节点的相对重要性。
The paper presents the method of seeking spanning trees of undirected graphs by adopting calculating trees which is realized by enumerating the difference among spanning trees.
文章描述采用计算树的方法求解无向图的生成树，这种方法是通过列举生成树之间的差别来实现的。
In this note, no using the contraction method, we prove that if a graph G is one edge short of having two edge-disjoint spanning trees, then G has a cut edge or G is supereulerian.
本文不利用收缩方法，直接证明了：当图G至多差一边有两棵边不相交的生成树时，G是超欧拉图或者G有割边。
A formula for the number of their spanning trees was given, Furthermore its asymptotic behaviors were considered and the linear recurrence relations with constant coefficients were also obtained.
给出其支撑树数的一个公式，并得到其渐近性态和常数系数的线性递归关系。
However, in such clustering algorithms, the search for nearest neighbor in the construction of minimum spanning trees is the main source of computation and the standard solutions take o (N-2) time.
然而，在这样的聚类算法，对最近在最小生成树建设邻居搜索是计算的主要来源和标准的解决方案采取的O (N - 2)的时间。
So, by measuring the ratio of the two isotopes in the rings of trees, and matching the result to the age of the ring, a history of hurricanes spanning the life of the tree can be reconstructed.
因此，通过测量树的不同年轮(ring)中两种氧同位素的比例，并将结果比对年轮所显示的树龄，就可再现树木一生中所经历的所有飓风。
With trees equal to one hectare of forest spanning 27 floors, these 365 and 260-foot emerald, twin towers will be home to an astonishing 730 trees, 5, 000 shrubs and 11, 000 ground plants.
27个楼层覆盖满了相当于一公顷森林面积的树木，这两座分别高365英尺（111米）和260英尺（79米）的高楼变成了翠绿色。 这座双塔式建筑将种满730棵树木、500棵灌木以及1.1万株地面植物。
With trees equal to one hectare of forest spanning 27 floors, these 365 and 260-foot emerald, twin towers will be home to an astonishing 730 trees, 5, 000 shrubs and 11, 000 ground plants.
27个楼层覆盖满了相当于一公顷森林面积的树木，这两座分别高365英尺（111米）和260英尺（79米）的高楼变成了翠绿色。 这座双塔式建筑将种满730棵树木、500棵灌木以及1.1万株地面植物。
应用推荐