ts-priority-queue

A priority queue data structure implemented in TypeScript, providing O(log n) insertion and removal. Version 0.1.1 is the current stable release. The library uses a binary heap strategy and is a port of the CoffeeScript js-priority-queue, with array and BHeap strategies removed. It offers a simple API: queue, dequeue, peek, clear, and length. Supports custom comparators and initial values. Ideal for TypeScript projects needing a minimal, dependency-free priority queue. However, it is a small, possibly unmaintained package with limited testing and documentation.