Py-heapdict

Jul 20, 2023

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

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



Checkout these related ports:
  • Zziplib - Library to provide transparent read access to zipped files
  • Zydis - Fast and lightweight x86/x86-64 disassembler library
  • Zycore-c - Support library with platform independent types, macros, etc for Zydis
  • Zthread - Platform-independent object-oriented C++ threading library
  • Zookeeper - Coordination Service for Distributed Applications
  • Zls - Zig LSP implementation + Zig Language Server
  • Zfp - High throughput library for compressed floating-point arrays
  • Zeal - Offline documentation browser
  • Zapcc - C++ caching compiler based on clang
  • Zanata-platform - Web-based translation platform
  • Zanata-cli - Zanata Java command line client
  • Z88dk - Complete Z80/Z180 development kit
  • Z80ex - ZiLOG Z80 CPU emulator library
  • Z80asm - Assembler for the Z80 microprocessor
  • Z80-asm - Z80 assembly code assembler and disassembler