Implementation of a binomial heap data structure, i.e. a
priority datastructure with
pop in amortized
binomial_heap wraps a
using Rcpp modules. The heap consists of nodes with
keys and values where the key determines the priority in the heap.
Also see the
C++ object representing a heap
the class of the keys
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.