A priority queue implemented with a binary heap
npm install @darkblue_azurite/priority-queuePriority Queue
==============



A priority queue implemented with a binary heap
Installation
------------
For node js:
```
npm install --save @darkblue_azurite/priority-queue
then require it:
`js`
var PriorityQueue = require("@darkblue_azurite/priority-queue");
To use the library directly in the browser, copy the priority-queue.js file from the libpriority-queue.min.js
directory into your project and include it in your webpage. provides
you with a minified version. The files in the lib directory are also transpiled to es5.
`html`
Example Usage
-------------
`js
var tasks = [
{ task: "Wash the Dishes", priority: 5 },
{ task: "Clean the Bedroom", priority: 3 },
{ task: "Feed the Cat", priority: 1 },
{ task: "Do Groccery Shopping", priority: 8 }
];
var queue = new PriorityQueue(tasks, function(t1, t2) {
return t1.priority - t2.priority;
});
queue.size(); // 4
queue.dequeue(); // { task: "Feed the Cat", priority: 1 }
queue.enqueue({ task: "Go to the Gym", priority: 2 });
``
Documentation
-------------
* API Documentation