datastructures-js / priority-queue

:1234: A heap-based implementation of priority queue

datastructures-js/priority-queue Issues

Heap initialization utility `MaxPriorityQueue.from` is O(N log N)
Updated 3 months ago
How to avoid duplicates?
Updated 3 months ago
Feature request: Be able to init a new `PriorityQueue` from an array with priority property in v5
Updated 5 months ago1
You apparantly published an old version (4.2.0) which now appears as latest instead of 6.3.0
Closed 6 months ago1
Feature Request: update method
Closed 6 months ago1
How to contribute to v5?
Closed 10 months ago5
remove method
Closed a year ago2
我在leetcode中对MinPriorityQueue实例化，然后使用enquene方法报错
Closed 3 years ago12
Can't use PriorityQueue on Leetcode but MaxPriorityQueue and MinPriorityQueue are working fine
Closed 2 years ago9
".enqueue expects a numeric priority".
Closed a year ago1
upgrade heap version
Closed 2 years ago
Add remove method
Closed 2 years ago4
return elements in [Min/Max]PriorityQueue without an object literal
Closed 2 years ago
Expose PriorityQueue class with comparator would be more understandable
Closed 3 years ago
Could this library support customized function as comparator for priority property?
Closed 3 years ago7
Can't set non-positive priority in LeetCode environment
Closed 3 years ago1
Priority can be 0
Closed 4 years ago1