queue-queue
Name inspired by the sound birds make "cuckoo"
A simple priority queue crate that supports defining the priority of an element with zero default dependencies. All queues depend on 2 types P the priority, that implements PartialOrd + PartialEq + Eq and T the value, that implements PartialEq + Eq.
All priority queues implement the trait PriorityQueue from prelude, and the available queues are:
RustyPriorityQueuewhich is based on top of Rust'sBinaryHeap. Highest priority has the highest PartialOrd value.InversePriorityQueuewhich is based on top of Rust'sBinaryHeap. Highest priority has the lowest PartialOrd value.