Introduction - If you have any usage issues, please Google them yourself
Spanning Tree for the largest, is actually the minimum spanning tree algorithm-based improvement, I used the Kruskal algorithm, the basic idea is to the right of each side in order, then joined the spanning tree, formed in Central Point skip until Spanning Tree greatest generation. Java is characterized easier to input and output, Therefore, the key is to use the plan to monitor the initialization and tree generation convergence.
Packet : 55593407maxspanningtree.rar filelist
MaxSpanningTree.java