What do I use for a max-heap implementation in Python?

python data-structures heap recursive-datastructures
Douglas Mayle picture Douglas Mayle · Mar 23, 2010 · Viewed 139.4k times · Source

Python includes the heapq module for min-heaps, but I need a max heap. What should I use for a max-heap implementation in Python?

Answer

Daniel Stutzbach picture Daniel Stutzbach · Mar 23, 2010

The easiest way is to invert the value of the keys and use heapq. For example, turn 1000.0 into -1000.0 and 5.0 into -5.0.

Related questions

What is Python's heapq module?

I tried "heapq" and arrived at the conclusion that my expectations differ from what I see on the screen. I need somebody to explain how it works and where it can be useful. From the book Python Module of the …

Read More
How to make heapq evaluate the heap off of a specific attribute?

I wish to hold a heap of objects, not just numbers. They will have an integer attribute in them that the heap can sort by. The easiest way to use heaps in python is heapq, but how do I tell …

Read More
What's the difference between heapq and PriorityQueue in python?

In python there's a built-in heapq algorithm that gives you push, pop, nlargest, nsmallest... etc that you can apply to lists. However, there's also the queue.PriorityQueue class that seems to support more or less the same functionality. What's the …

Read More