用各种求解最小生成树的算法实现最小生成树的动态演示-Solving the minimum spanning tree algorithm to achieve the dynamic presentation of the minimum spanning tree

This paper presents a new algorithm for partitioning a gray-level image into connected homogeneous regions. The novelty of this algorithm lies in the fact that, by constructing a minimum spanning tree representation of a gray-level image, it reduce