Function deleteMinimum

Graphs/minimum_spanning_tree_prims.py:65–69

(heap, positions)

            topToBottom(heap, i, len(heap), positions)

    def deleteMinimum(heap, positions):
        temp = positions[0]
        heap[0] = sys.maxsize
        topToBottom(heap, 0, len(heap), positions)
        return temp

    visited = [0 for i in range(len(l))]
    Nbr_TV  = [-1 for i in range(len(l))] # Neighboring Tree Vertex of selected vertex