spanning tree造句
1. The player number decreasing minimum cost spanning tree game.
2. Explanation:To communicate and compute the spanning tree topology, BPDU are transmitted from each switch(configuration BPDUs) and in one direction from the root switch.
3. Minimum spanning tree data structure source code. Hope useful for all of us. Thanks!
4. Using matlab language Kruskal minimum spanning tree algorithm for general - purpose source.
5. According to the related optimizing theory, the Minimum Spanning Tree arithmetic and the Rectilinear SteinerMinimum Tree arithmetic were selected as the solution of the problem in this thesis.
6. Most of the Spanning Tree Algorithm(STA) failures occur due to the excessive loss of BPDUs causing the blocked ports to transition to forwarding mode.
7. Based on the improved minimum-cost spanning tree algorithm (MCST), a high efficiency approach to optimal expansion planning for the distribution network is put forward.
8. The fundamental circuits relative to a spanning tree is a basis of the circ subspace.
9. The minimum spanning tree(MST) was used to obtain the best connected-component of the image set to recover the transformation between images and project the images into the mosaic frame.
10. First, this paper analyzes degree-constraint minimum diameter spanning tree algorithm– the CT algorithm, and proposes the improved CT algorithm.
11. Compare to the IEEE 802.1D spanning tree protocol, the rapid spanning tree protocol has been improved in the constringency speed.
12. Automatic spanning tree, but also to look for beginners, small knowledge.
13. A mobile agent-based heuristic depth-first coloration spanning tree algorithm is proposed. The algorithm is exploited to divide a gigantic network into several small-scale sub-networks.
14. The spanning tree and basic loop method for distinguishing negative sub-chain in kinematics chain was put ford.
15. The integer program model of minimal spanning tree was built up by the concepts of root and level of node in LINGO.
16. The shortest spanning tree approach considers the relationship of the neighbouring pixels, thus improves the robustness and accuracy of the segmentation.
17. Secondly, the breadth-first-search-based spanning tree algorithm is applied to find out the initial boundary matching between the retrieval object and the retrieval condition.
18. This paper presents an extended double list storage structure based on a double list storage structure and then applies it to the minimum spanning tree algorithm.
19. In this paper, a parthenogenetic algorithm for solving the degree-constrained minimum spanning tree problem is proposed.
20. This paper studied the protection mechanism for virtual ring in mesh topology, and analyzed a construction algorithm for a virtual ring based on spanning tree.
21. Last, the partition algorithm which has been improved is proposed, meanwhile, the basic idea of Minimum Cost Spanning tree is presented.
22. This paper discusses the application of adjacency matrix at the algorithm's analysis for traversing Graph, Minimum cost Spanning Tree, Topological sort and Critical Path.
23. Concept and implement of graph, basic operations of graph, minimum cost spanning tree, shortest path problem, AOV and AOE network.
24. A routing protocol for wireless sensor networks was proposed. The protocol used a data aggregation scheme of minimum transmission cost spanning tree.
25. The normal and curvature of point cloud model are estimated with PCA (Principal Component Analysis). The adjustment of normal direction is achieved by using Minimum Spanning Tree.
26. In order to analyze the structure of a dataset simply and efficiently, this paper proposes a new clustering algorithm based on minimal spanning tree: MSTCA.
27. The dissertation presents a heuristic algorithm of modified Minimum Spanning Tree(MST) for solving the mathematical model of the refuse collection problem.
28. A multi - stage planning approach considering uncertainty is put forward based on improved minimum - cost spanning tree algorithm.
29. Third, an efficient enumeration algorithm is proposed for solving the constrained minimum spanning tree problem.
30. The Knowledge Consistency Checker (KCC) was not able to build a spanning tree topology.
12