Implementation of a binomial heap data structure, i.e. a
priority datastructure with push and pop in amortized
O(log n). binomial_heap wraps a boost::binomial_heap
using Rcpp modules. The heap consists of nodes with
keys and values where the key determines the priority in the heap.
Also see the binomial_heap class.
.heapC++ object representing a heap
.key.classthe class of the keys
binomial_heap for creating a new binomial_heap object