This crate provide a priority queue backed by an hashmap with some efficient methods to change the priority of an element in O(log(N)) time (worst case).
The elements(called Item
s, of type I
) must implement [Hash
]
(https://doc.rust-lang.org/std/hash/trait.Hash.html)
and Eq
traits.
The priority P
may be any type that implements [Ord
]
(https://doc.rust-lang.org/std/cmp/trait.Ord.html).
For reverse order remember the standard wrapper [Reverse<T>
]
(https://doc.rust-lang.org/std/cmp/struct.Reverse.html)
#Example
extern crate priority_queue;
use PriorityQueue;