uheapq – heap queue algorithm
This module implements a subset of the corresponding
as described below. For more information, refer to the original
This module implements the heap queue algorithm.
A heap queue is simply a list that has its elements stored in a certain way.
item onto the
Pop the first item from the
heap, and return it. Raises IndexError if
heap is empty.
Convert the list
x into a heap. This is an in-place operation.