Implementing Prim Algorithm and Its Analysis Based On Fibonacci Heap
Qiang Ma · Journal of Yanan University · 2009
Solving minimum spanning tree is often required for several network optimization applications.Adata structure called was first introduced and how to implement prim algorithm with Fibonacci heaps was stated.Then the time complexity of prim algorithm was analyzed and showed that in this method has better time performance.