摘要
Kruskal算法和Prim算法是求最小生成树的常用算法，文章设计了这两种算法的C语言程序，并通过实例说明了算法的应用。
Kruskal algorithm and Prim algorithm are general methods for sieving the minimum spanning tree. The C programming language each of them is designed in this paper, examples show the application of the two algorithm.
