Are, the, heap operations, the deletions and re-insertions that are triggered by needing to decrease the key avertices that are not in X. Indeed, in a single iteration of Prim's algorithm, in a single move of a vertex inside of capital X, can necessitate a large number of heap operations. 