Skip to main content

a heap with decrease-key and increase-key operations

Project description

heapdict implements the MutableMapping ABC, meaning it works pretty much like a regular Python dict. It’s designed to be used as a priority queue, where items are added and consumed as follows:

hd = heapdict()
hd[obj1] = priority1
hd[obj2] = priority2
# ...
obj = hd.pop()

Compared to an ordinary dict, a heapdict has the following differences:

popitem():
Remove and return the (key, priority) pair with the lowest priority, instead of a random object.
peekitem():
Return the (key, priority) pair with the lowest priority, without removing it.

Unlike the Python standard library’s heapq module, the heapdict supports efficiently changing the priority of an existing object (often called “decrease-key” in textbooks). Altering the priority is important for many algorithms such as Dijkstra’s Algorithm and A*.

Project details


Download files

Download the file for your platform. If you're not sure which to choose, learn more about installing packages.

Filename, size & hash SHA256 hash help File type Python version Upload date
HeapDict-1.0.0.tar.gz (7.7 kB) Copy SHA256 hash SHA256 Source None Oct 16, 2009

Supported by

Elastic Elastic Search Pingdom Pingdom Monitoring Google Google BigQuery Sentry Sentry Error logging AWS AWS Cloud computing DataDog DataDog Monitoring Fastly Fastly CDN DigiCert DigiCert EV certificate StatusPage StatusPage Status page