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

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

de.lmu.ifi.dbs.elki.algorithm	Algorithms suitable as a task for the KDDTask main routine.
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.algorithm.outlier	Outlier detection algorithms
de.lmu.ifi.dbs.elki.database.query.knn	Prepared queries for k nearest neighbor (kNN) queries.
de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants	M-Tree and variants.
de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.mktrees	Metrical index structures based on the concepts of the M-Tree supporting processing of reverse k nearest neighbor queries by using the k-nn distances of the entries.
de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.mktrees.mkapp	MkAppTree
de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.mktrees.mkcop	MkCoPTree
de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.mktrees.mkmax	MkMaxTree
de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.mktrees.mktab	MkTabTree
de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.query	Classes for performing queries (knn, range, ...) on metrical trees.
de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants.query	Queries on the R-Tree family of indexes: kNN and range queries.
de.lmu.ifi.dbs.elki.utilities.datastructures.heap	Heap structures and variations such as bounded priority heaps.

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

KNNHeap
Heap used for KNN management.

KNNList
Finalized KNN List.

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

KNNList
Finalized KNN List.

UpdatableHeap
A heap as used in OPTICS that allows updating entries.

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

Heap
Basic in-memory heap structure.

IntegerPriorityObject
Object for a priority queue with integer priority.

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

KNNList
Finalized KNN List.

Classes in de.lmu.ifi.dbs.elki.utilities.datastructures.heap used by de.lmu.ifi.dbs.elki.database.query.knn

KNNHeap
Heap used for KNN management.

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

KNNHeap
Heap used for KNN management.

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

KNNHeap
Heap used for KNN management.

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

KNNList
Finalized KNN List.

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

KNNList
Finalized KNN List.

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

KNNHeap
Heap used for KNN management.

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

KNNHeap
Heap used for KNN management.

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

KNNHeap
Heap used for KNN management.

Classes in de.lmu.ifi.dbs.elki.utilities.datastructures.heap used by de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants.query

KNNHeap
Heap used for KNN management.

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

Heap
Basic in-memory heap structure.

IntegerPriorityObject
Object for a priority queue with integer priority.

KNNHeap
Heap used for KNN management.

KNNList
Finalized KNN List.

TiedTopBoundedHeap
A size-limited heap similar to TopBoundedHeap, discarding elements with the highest value.

TopBoundedHeap
Heap class that is bounded in size from the top.