Priority queues are dynamic sets that always remove highest priority elements first.
3
votes
1answer
37 views
d-ary heap in C
Now I have this d-ary heap data structure. Note that for d = 2 this is a binary heap. The client programmer specifies the value ...
4
votes
2answers
267 views
ObservablePriorityQueue<T> Implementation
I have a requirement in my current project that will need a Prioritised Queue that supports the IObservable interface. Please notify me of any problems with the implementation that I currently have:
...
4
votes
1answer
2k views
Javascript PriorityQueue based on object property
I wrote this class which is a priority queue based on a numeric property of any object. As far as I can tell, the following code is working as intended. Are there any stylistic tendencies that I am ...
6
votes
2answers
680 views
My implementation of FixedSizedPriorityQueue
I implemented a fixed sized priority queue.
How can I improve my code?
...
