HeapDict
a heap with decrease-key and increase-key operations
Decision gist · record as of 2026-08-14
Yes, if you need a priority queue with efficient decrease-key operations and can accept that the package is no longer maintained. It has no dependencies, installs easily, carries no known vulnerabilities, and solves a real problem the standard library doesn't address. However, verify it works on your target Python version and consider whether an actively maintained alternative better suits your long-term needs.AI-flagged interpretation of the facts on this page — verify before relying
Before you install
- Installation is straightforward with no runtime dependencies.
- The package is marked abandoned (last release 2019-09-09, 2531 days ago), so expect no active maintenance or bug fixes.
License · maintenance · safety
BSD (permissive) — Licensed under BSD (permissive), so you may use, modify, and distribute it freely in both open and closed projects with minimal restrictions.
last release 2019-09-09 (2531 days)
0 known vulnerabilities (OSV.dev, 2026-08-14) · 412,649 downloads/mo, #6,846 on PyPI
Alternatives
Verify before relying
from heapdict import heapdict
hd = heapdict()
hd['obj1'] = 1
hd['obj2'] = 2
key, priority = hd.popitem()- Whether the package works reliably on modern Python versions beyond those listed in classifiers.
- Performance characteristics compared to alternative priority queue implementations for large datasets.
- Whether any edge cases or bugs have been discovered since the final 2019-09-09 release.
What it is and what it does
HeapDict implements a priority queue as a mutable mapping—it behaves like a Python dict but maintains heap ordering. You assign priorities to keys and retrieve the lowest-priority item with popitem(), or peek at it without removal using peekitem(). Unlike the standard library's heapq, HeapDict lets you efficiently update an existing key's priority, which is essential for graph algorithms like Dijkstra's shortest path and A* search.
The package has no runtime dependencies and installs cleanly as a pure Python wheel. It is marked abandoned, with the last release in 2019-09-09 and no active repository maintenance, so it receives no updates or bug fixes. The BSD license is permissive and poses no restrictions for most use cases.
Use it for
- Implementing Dijkstra's shortest-path algorithm where you need to update node priorities as better paths are discovered.
- Building an A* pathfinding search where heuristic estimates require efficient priority adjustment during exploration.
- Any graph or optimization algorithm that maintains a working set of candidates with changing priority scores.
- Prototyping or teaching priority queue concepts when you need dict-like access with heap semantics.
Worth the install?
AI-flagged interpretation of the facts on this page. Verify before relying on it.
Yes, if you need a priority queue with efficient decrease-key operations and can accept that the package is no longer maintained.
It has no dependencies, installs easily, carries no known vulnerabilities, and solves a real problem the standard library doesn't address. However, verify it works on your target Python version and consider whether an actively maintained alternative better suits your long-term needs.
Install
heapdict on PyPI
Before you install
Installation is straightforward with no runtime dependencies. The package is marked abandoned (last release 2019-09-09, 2531 days ago), so expect no active maintenance or bug fixes.
License in practice
Licensed under BSD (permissive), so you may use, modify, and distribute it freely in both open and closed projects with minimal restrictions.
Quickstart
from heapdict import heapdict
hd = heapdict()
hd['obj1'] = 1
hd['obj2'] = 2
key, priority = hd.popitem()Verify before relying
- Whether the package works reliably on modern Python versions beyond those listed in classifiers.
- Performance characteristics compared to alternative priority queue implementations for large datasets.
- Whether any edge cases or bugs have been discovered since the final 2019-09-09 release.
Package facts
| License | BSD permissive |
| Python support | Not specified |
| Install friction | Low. Pure-Python wheel |
| Runtime dependencies | None |
| Maintenance | Abandoned 2,531 days since the last release |
| First released | |
| Downloads | 412,649 / month, #6,846 on PyPI 30-day window, as of 2026-08-14 |
| Known vulnerabilities | None known OSV.dev, checked 2026-08-14 |
| Classifiers | Development Status :: 5 - Production/StableIntended Audience :: DevelopersLicense :: OSI Approved :: BSD LicenseOperating System :: OS IndependentProgramming Language :: Python :: 2.6Programming Language :: Python :: 2.7Programming Language :: Python :: 3Programming Language :: Python :: 3.0Programming Language :: Python :: 3.1Programming Language :: Python :: 3.2Topic :: Software Development :: Libraries :: Python Modules |
Evidence: HeapDict-1.0.1-py3-none-any.whl
Tags
Let your AI agent find packages like this
Example. Real query, live index.
You found this page by searching. An agent finds it by wishing: SkillFed indexes 14,416 PyPI packages by what they can do, searchable in plain language.
wish › “priority queue with decrease-key”
- HeapDictHeapDict is a mutable mapping that acts as a priority queue,…
- queuelibQueuelib provides in-memory and disk-persisted queue, stack, priority…
- priorityImplements HTTP/2 stream priority scheduling according to RFC 7540,…
Give your agent the search over MCP, or paste the wish link into any chat.
More Python Modules packages
Converts domain names between Unicode and ASCII-compatible encoding (Punycode) according to IDNA 2008 and Unicode Technical Standard 46, with security validation and broader script coverage than the standard library.
Install it if you work with internationalized domain names, need to validate domains, or use HTTP clients that depend on it transitively.
Setuptools is a Python build backend and package management tool that handles building, distributing, and installing Python packages, including support for C/C++ extension modules.
PyYAML parses and emits YAML 1.1 data format, enabling serialization and deserialization of configuration files and Python objects to and from human-readable YAML text.
Pydantic validates Python data structures against type hints, coercing and checking input at runtime to ensure it matches a declared schema.
Provides reusable metadata objects for use with PEP-593 `typing.Annotated` to express common constraints like bounds, collection sizes, and predicates on types.
Install it if you use or build libraries that need to express type constraints in a standardized, inspectable way—or if you want to annotate your own types with…
Provides runtime tools to inspect and introspect Python type annotations, enabling programmatic examination of type hints at execution time.
See also queuelib · zict · persist-queue · recordclass · multiset · Dijkstar · guppy3 · priority · rq · constantdict