Class Based Heapq Algorithm

Install

pip install python-heapq

Example

Priorityq pushes and pops while maintaining the structure of the heap. Push an element and then pop it to get a sorted list.

from python_heapq import priorityq

queue = priorityq([]) # init heapq data

queue.push(2)
queue.push(4)
queue.push(1)
queue.push(7)

while queue.data:
    poped = queue.pop()
    print(poped)

# 1
# 2
# 4
# 7