Description
Use a heap-based priority dictionary with efficient priority updates. It helps algorithms such as shortest paths, schedulers, and queues adjust item priorities without rebuilding the whole structure.
This is a developer data-structure library. Correctness depends on how priorities are updated and compared, so algorithms should test duplicate, missing, and changed-key cases.