Solving minimum spanning tree with reduction technology
基于降阶的最小生成树快速算法

Based on the mathematical properties of minimum spanning tree (MST), presented a new and fast MST algorithm with reduction technology. Accelerated the algorithm by using the reduction technolgy and the time complexity in worst case was O(m). On the other hand the algorithm could be used to find all MST of a connected graph at the same time.