The data structure used for implementing Priority Queue affects the running time of Prims

algorithm. The following table summarizes the time complexity of various Priority Queue operations $($let N denote the number of vertices and E denote the number of edges$)$ for three different

implementations using an Array, Binary$-$Heap and Fibonacci$-$Heap