Updatable Priority Queue

A generic priority queue implementation based on a binary heap with an efficient updateKey operation, version 0.0.1. Release cadence is currently unknown as it's a new package. Key differentiator vs other priority queues: it supports updating the key of an element after insertion, which is essential for algorithms like Dijkstra's or A* pathfinding where priorities change incrementally. Built primarily for the jKstra graph library but generally useful.