Discussions about the Two Algorithms for Finding the Minimal Spanning Tree of an Undirected Weighted Graph
Nan Chen · 2004
The two algorithms for finding the minimal spanning tree of an undirected weighted graph are PRIM algorithm and KRUSKAL algorithm. This paper improves the method for selecting the minimal edge in PRIM algorithm by using a heap. Combining the characteristics of programming langrage C, it implements set partition and merger and explores the realization of KRUSCAL algorithm. This overcomes the shortage of not giving the KRUSCAL algorithm in langrage C in some data structure textbooks.