说明：  两种次小生成树算法，基于替换边法的O(N^2+O(Kruskal))以及它的优化，代码简洁，自己总结~
(Two kinds of views of small spanning tree algorithm, based on the replacement side of the law O (N ^ 2+ O (Kruskal)) and its optimization, code simplicity, their sum ~)