Login Register

heapq.heappop()

heapq.heappop(heap)

Pop and return the smallest item from the heap, maintaining the heap invariant. If the heap is empty, IndexError is raised. To access the smallest item without popping it, use heap[0].

Links:

https://docs.python.org/3.5/library/heapq.html#heapq.heappop

doc_python

2025-01-10 15:47:30

Comments

Leave a Comment

Please login to continue.

Popular Articles

heapq.nlargest() heapq.nlargest(n, iterable, key=None) Return a list with the n largest elements from the dataset defined by iterable. key, if provided, specifies

heapq.heappush() heapq.heappush(heap, item) Push the value item onto the heap, maintaining the heap invariant.

heapq.nsmallest() heapq.nsmallest(n, iterable, key=None) Return a list with the n smallest elements from the dataset defined by iterable. key, if provided, specifie

heapq.heappushpop() heapq.heappushpop(heap, item) Push item on the heap, then pop and return the smallest item from the heap. The combined action runs more efficientl

heapq.heapify() heapq.heapify(x) Transform list x into a heap, in-place, in linear time.