pqjs

Pq.js provides a fast, straightforward priority queue to manage data based on priority. Ideal for sorting, task
scheduling, or implementing priority-based logic in your app.

- ⚡ Simple and fast priority queue operations.
- 🔽🔼 Supports both Min-Heap and Max-Heap configurations.
- 🌱 No dependencies.

Perfect for anyone needing a priority queue implementation in JavaScript.

Installation

``sh
npm install pqjs
`

Usage

$3

`javascript
import {PriorityQueue} from "pqjs"
`

$3

`javascript
const pq = new PriorityQueue()
`

$3

`javascript
const initialValues = [10, 5, 20]
const pq = new PriorityQueue(initialValues)
`

$3

`javascript
pq.push(10)
pq.push(5)
pq.push(20)
`

$3

`javascript
console.log(pq.top()) // 20 for Max-Heap by default
`

$3

`javascript
console.log(pq.pop()) // 20
`

$3

`javascript
console.log(pq.empty()) // false
`

$3

`javascript
pq.clear()
console.log(pq.empty()) // true
`

$3

`javascript
console.log(pq.toArray()) // []
`

$3

`javascript
const minHeapComparator = (a, b) => b - a
const minHeap = new PriorityQueue([], minHeapComparator)

minHeap.push(10)
minHeap.push(5)
minHeap.push(20)

console.log(minHeap.pop()) // 5 for Min-Heap
console.log(minHeap.pop()) // 10 for Min-Heap
console.log(minHeap.pop()) // 20 for Min-Heap
``

License

MIT © 2025 Vusal Huseynov