Skip to main content
This is a pre-production deployment of Warehouse. Changes made here affect the production instance of PyPI (pypi.python.org).
Help us improve Python packaging - Donate today!

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*.

Release History

Release History

This version
History Node

1.0.0

History Node

0.1.5

History Node

0.1.4

History Node

0.1.2

History Node

0.1.1

History Node

0.1.0

Download Files

Download Files

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

File Name & Checksum SHA256 Checksum Help Version File Type Upload Date
HeapDict-1.0.0.tar.gz (7.7 kB) Copy SHA256 Checksum SHA256 Source Oct 16, 2009

Supported By

WebFaction WebFaction Technical Writing Elastic Elastic Search Pingdom Pingdom Monitoring Dyn Dyn DNS Sentry Sentry Error Logging CloudAMQP CloudAMQP RabbitMQ Heroku Heroku PaaS Kabu Creative Kabu Creative UX & Design Fastly Fastly CDN DigiCert DigiCert EV Certificate Rackspace Rackspace Cloud Servers DreamHost DreamHost Log Hosting