Crate flex_algo

source ·
Expand description

PriorityQueue

This data structure implements a Priority Queue with a comparator function to specify the Min/Max heap. The queue is implemented as a heap of indexes.

Re-exports

pub use self::priority_queue::PriorityQueue;

Modules