| 1. | Virtually the only concept to be used is that of a spanning tree .
更确切地说，只使用了生成树的概念。 |
| 2. | There is a recursive formula for the number of spanning trees in a graph .
对于一个图的生成树的棵数，存在一个递推公式。 |
| 3. | In particular, if t is a spanning tree of g, we shall call its complement t' a cotree .
如果T是G的一棵生成树，我们称它的补集T'为一副树。 |
| 4. | The relationship between bonds and cotrees is analogous to that between cycles and spanning trees .
键和余树之间的关系类似于圈和生成树之间的关系。 |
| 5. | Control automatically generates tree node bindings
控件是否自动生成树节点绑定。 |
| 6. | Control automatically generate tree node bindings ; otherwise ,
控件自动生成树节点绑定，则为 |
| 7. | A mst based clustering method with controlling vertexes
一种带控制节点的最小生成树聚类方法 |
| 8. | Figures 3 and 4 show the code generation tree structures built from the
中的绑定构建的代码生成树结构。 |
| 9. | Minimum spanning tree algorithm based on extended double list storage structure
基于扩展双链式存储结构的最小生成树算法 |
| 10. | Minimum spanning tree
最小代价生成树 |
