rheaps 0.16.0

Heap data structures for Rust
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12

//! Directed-acyclic-graph heap implementations.
//!
//! This module currently provides a hollow heap. Hollow heaps use a DAG of
//! full and hollow nodes so decreasing a non-minimum key does not require
//! cutting the old node from its parent.

mod hollow_heap;

pub use hollow_heap::{HollowHandle, HollowHeap};

#[cfg(test)]
mod tests;