uheapq
This module implements the heap queue algorithm.
A heap queue is simply a list that has its elements stored in a certain way.
uheapq.
heappush
Push the item onto the heap.
item
heap
heappop
Pop the first item from the heap, and return it. Raises IndexError if heap is empty.
heapify
Convert the list x into a heap. This is an in-place operation.
x