求最大生成树，实际上是以最小生成树的算法为基础进行改进，我采用的是kruskal算法，基本思路是对各个边的权进行排序，然后加入生成树，形成环的点跳过，直到生成最大生成树。JAVA的特点是输入输出比较便利，所以问题的关键在于用监控将图的初始化和树的生成衔接。-Spanning Tree for the largest, is actually the minimum spanning tree algorithm-based improvement, I used the Kruskal algo

使用Weka分析环境开发的基于Java的图像分割及基于内容检索程序，分割采用最小生成树分割法，检索利用的是小波和共生矩阵提取的特征。-Analysis using the Weka environment for the development of Java-based content-based image segmentation and retrieval procedures, division of segmentation using minimum spanning tree,

In computer science, Prim s algorithm is an algorithm that finds a minimum spanning tree for a connected weighted undirected graph.

Prim´ s algorithm using graphics finds a minimum spanning tree for a connected weighted undirected graph.