1. The integer program model of minimal spanning tree was built up by the concepts of root and level of node in LINGO.

2. This paper narrated and proved an minimal spanning tree algorithm which requires no consideration of circles.

3. The integer program model of minimal spanning tree was built up by the concepts of root and level of node in LINGO. There are particular notes to the difficulties of the model.

4. The two algorithms for finding the minimal spanning tree of an undirected weighted graph are PRIM algorithm and KRUSKAL algorithm.

5. 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.

6. We have developed a methodology to quantitatively study tumor cell heterogeneity from a topographical point of view through the concept of a minimal spanning tree graph.

7. This procedure give a more accurate representation of the intra-market structure than the commonly used method of constructing minimal spanning tree from the unfiltered correlation matrix.

8. At the same time, two new algorithms which are lustful algorithm and the method of modifying the minimal spanning tree are presented.

8. is a online sentence dictionary, on which you can find nice sentences for a large number of words.

9. The eco logical similarity of weeds was also analysed by the minimal spanning tree method of fuzzy graphy theory based on their niche overlaps.

10. A numerical classification on the genus Salix of the Chinlin and the construction of minimal spanning tree.