fibonacci_heap-class

Implementation of a Fibonacci heap data structure, i.e. a
 priority datastructure with <code>push</code> in amortized O(1) and
 <code>pop</code> in O(log n). <code>fibonacci_heap</code> wraps a
 <code>boost::fibonacci_heap</code> using Rcpp modules. The heap consists of
 nodes with keys and values where the key determines the priority in the
 heap. Also see the <code><a href="/link/?package=datastructures&version=0.2.9" binomial_heap'="" data-mini-rdoc="datastructures::"></a>'>binomial_heap</code> class.

Implementation of advanced data structures such as hashmaps,
heaps, or queues. Advanced data structures are essential
in many computer science and statistics problems, for example graph
algorithms or string analysis. The package uses 'Boost' and 'STL' data
types and extends these to R with 'Rcpp' modules.

Simon Dirmeier

datastructures

Implementation of Core Data Structures

fibonacci_heap-class function

<dl class="dl-horizontal">
<dt><code>.heap</code></dt><dd><code>C++</code> object representing a heap</dd></dl><dt><code>.key.class</code></dt><dd>the class of the keys</dd>

Slots

Implementation of a Fibonacci heap data structure, i.e. a
 priority datastructure with <code>push</code> in amortized O(1) and
 <code>pop</code> in O(log n). <code>fibonacci_heap</code> wraps a
 <code>boost::fibonacci_heap</code> using Rcpp modules. The heap consists of
 nodes with keys and values where the key determines the priority in the
 heap. Also see the <code><a href='<a href='binomial_heap'></a>'>binomial_heap</a></code> class.

fibonacci_heap-class: Fibonacci heap class

Description

Arguments

Slots

See Also