priority-queue 0.1.0

A Priority Queue implemented as a heap with a function to efficiently change the priority of an item.
Documentation
PriorityQueue
=============

This crate implements a Priority Queue with a function to change the priority of an object.
Priority and items are stored in an `OrderMap` and the queue is implemented as a Heap of indexes.

Contributing
------------

Feel free to contribute to this project with pull request and/or issues. All contribution should be under a license compatible with the GNU LGPL.