Min Priority Queue

A TypeScript implementation of a min-priority queue data structure, extracted from the data-structure-typed collection. Version 2.6.0 offers a standalone binary heap-based priority queue with a customizable comparator for ordering elements. The package ships TypeScript declarations and supports ESM and CJS via module bundlers. It differentiates itself from built-in JavaScript priority queues by providing a dedicated min-heap with explicit add, poll, and peek methods, making it suitable for scheduling, event simulation, and algorithmic use cases. The library is actively maintained with regular releases.