|
|
|||||||||||||||||||||
PREV NEXT | FRAMES NO FRAMES |
Packages that use Heap | |
---|---|
de.lmu.ifi.dbs.elki.algorithm.clustering | Clustering algorithms
Clustering algorithms are supposed to implement the Algorithm -Interface. |
de.lmu.ifi.dbs.elki.utilities.heap | Variants of heap structures. |
Uses of Heap in de.lmu.ifi.dbs.elki.algorithm.clustering |
---|
Fields in de.lmu.ifi.dbs.elki.algorithm.clustering declared as Heap | |
---|---|
private Heap<D,DeLiClu.SpatialObjectPair> |
DeLiClu.heap
The priority queue for the algorithm. |
private Heap<D,OPTICS.COEntry> |
OPTICS.heap
The priority queue for the algorithm. |
Uses of Heap in de.lmu.ifi.dbs.elki.utilities.heap |
---|
Classes in de.lmu.ifi.dbs.elki.utilities.heap that implement Heap | |
---|---|
(package private) class |
Deap<K extends Comparable<K> & Serializable,V extends Identifiable & Serializable>
Subclass of a MinMaxHeap that can be an entry in a persistent heap. |
class |
DefaultHeap<K extends Comparable<K>,V extends Identifiable>
Implementation of a heap-based priority queue. |
class |
MinMaxHeap<K extends Comparable<K>,V extends Identifiable>
A double-ended priority queue implemented as a binary heap. |
class |
PersistentHeap<K extends Comparable<K> & Serializable,V extends Identifiable & Serializable>
Persistent implementation of a heap-based priority queue. |
|
|
|||||||||||
PREV NEXT | FRAMES NO FRAMES |