a heap with decrease-key and increase-key operations
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, priority) = hd.popitem()
Compared to an ordinary dict, a heapdict has the following differences:
- Remove and return the (key, priority) pair with the lowest priority, instead of a random object.
- 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*.
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
|Filename, size||File type||Python version||Upload date||Hashes|
|Filename, size HeapDict-1.0.1-py3-none-any.whl (3.9 kB)||File type Wheel||Python version py3||Upload date||Hashes View|
|Filename, size HeapDict-1.0.1.tar.gz (4.3 kB)||File type Source||Python version None||Upload date||Hashes View|