Expand description
A simple priority queue implemented as a binary heap stored in a Vec<T>.
This implementation aims to be simple and more flexible than the one
provided by the standard library. It relies on a given function to determine
priority between elements. Let you acces the underlying Vec<T> with
consistency check or not.
Structsยง
- Checked
Mut - Drain
- Into
Iter - Prio
Queue - A priority queue implemented as a binary heap stored in a
Vec<T>