Uses of Package
de.lmu.ifi.dbs.elki.utilities.heap

Packages that use de.lmu.ifi.dbs.elki.utilities.heap

de.lmu.ifi.dbs.elki.algorithm.clustering	Clustering algorithms Clustering algorithms are supposed to implement the Algorithm-Interface.
de.lmu.ifi.dbs.elki.algorithm.clustering.correlation	Correlation clustering algorithms
de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.util	Helper classes for the the M-Tree and it's variants.
de.lmu.ifi.dbs.elki.utilities.heap	Variants of heap structures.

Classes in de.lmu.ifi.dbs.elki.utilities.heap used by de.lmu.ifi.dbs.elki.algorithm.clustering

Heap
Encapsulates methods common to all heaps.

Classes in de.lmu.ifi.dbs.elki.utilities.heap used by de.lmu.ifi.dbs.elki.algorithm.clustering.correlation

DefaultHeap
Implementation of a heap-based priority queue.

Classes in de.lmu.ifi.dbs.elki.utilities.heap used by de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.util

DefaultHeapNode
A default implementation of an object that can be stored in a heap.

HeapNode
Defines the requirements for an object that can be used as a node in a Heap.

Classes in de.lmu.ifi.dbs.elki.utilities.heap used by de.lmu.ifi.dbs.elki.utilities.heap

Deap
Subclass of a MinMaxHeap that can be an entry in a persistent heap.

DefaultIdentifiable
Default implementation of the identifiable interface.

Heap
Encapsulates methods common to all heaps.

HeapNode
Defines the requirements for an object that can be used as a node in a Heap.

MinMaxHeap
A double-ended priority queue implemented as a binary heap.