Prim's algorithm

Prim's algorithm is a simple greedy algorithm. The class notes indicate that Prim's algorithm as described above has a performance complexity of O(nm). However, Cormen et.al.[] claim a running time performance of assuming an algorithm that uses a priority queue implemented using a binary heap. Cormen et. al.[] claim a better performance for Prim's algorithm when the priority queue is implemented using Fibonacci heaps. In this case the running time can be reduced to .

 
Figure 2: Minimum Spanning Tree resulting from Prim's Algorithm