| Package | Description |
|---|---|
| de.lmu.ifi.dbs.elki.algorithm.clustering |
Clustering algorithms.
|
| de.lmu.ifi.dbs.elki.utilities.datastructures.heap |
Heap structures and variations such as bounded priority heaps.
|
| Modifier and Type | Field and Description |
|---|---|
private UpdatableHeap<DeLiClu.SpatialObjectPair> |
DeLiClu.heap
The priority queue for the algorithm.
|
| Modifier and Type | Class and Description |
|---|---|
class |
TiedTopBoundedUpdatableHeap<E>
A size-limited heap similar to
TopBoundedHeap, discarding elements
with the highest value. |
class |
TopBoundedUpdatableHeap<E>
Heap class that is bounded in size from the top.
|