|
||||||||||
PREV NEXT | FRAMES NO FRAMES |
Packages that use Heap | |
---|---|
de.lmu.ifi.dbs.elki.algorithm.clustering.correlation | Correlation clustering algorithms |
de.lmu.ifi.dbs.elki.utilities.datastructures.heap | Heap structures and variations such as bounded priority heaps. |
Uses of Heap in de.lmu.ifi.dbs.elki.algorithm.clustering.correlation |
---|
Methods in de.lmu.ifi.dbs.elki.algorithm.clustering.correlation with parameters of type Heap | |
---|---|
private CASHInterval |
CASH.determineNextIntervalAtMaxLevel(Heap<IntegerPriorityObject<CASHInterval>> heap)
Determines the next ''best'' interval at maximum level, i.e. the next interval containing the most unprocessed objects. |
private CASHInterval |
CASH.doDetermineNextIntervalAtMaxLevel(Heap<IntegerPriorityObject<CASHInterval>> heap)
Recursive helper method to determine the next ''best'' interval at maximum level, i.e. the next interval containing the most unprocessed objects |
private void |
CASH.initHeap(Heap<IntegerPriorityObject<CASHInterval>> heap,
Relation<ParameterizationFunction> relation,
int dim,
DBIDs ids)
Initializes the heap with the root intervals. |
Uses of Heap in de.lmu.ifi.dbs.elki.utilities.datastructures.heap |
---|
Subclasses of Heap in de.lmu.ifi.dbs.elki.utilities.datastructures.heap | |
---|---|
class |
KNNHeap<D extends Distance<D>>
Heap used for KNN management. |
class |
TiedTopBoundedHeap<E>
A size-limited heap similar to TopBoundedHeap , discarding elements with
the highest value. |
class |
TopBoundedHeap<E>
Heap class that is bounded in size from the top. |
class |
UpdatableHeap<O>
A heap as used in OPTICS that allows updating entries. |
|
|
|||||||||||
PREV NEXT | FRAMES NO FRAMES |