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

Package collects variants of heap structures.

See:
Description

Interface Summary

Heap<K extends Comparable<K>,V extends Identifiable>	Encapsulates methods common to all heaps.
HeapNode<K extends Comparable<K>,V extends Identifiable>	Defines the requirements for an object that can be used as a node in a Heap.

Class Summary

Deap<K extends Comparable<K> & Serializable,V extends Identifiable & Serializable>	Subclass of a MinMaxHeap that can be an entry in a persistent heap.
DefaultHeap<K extends Comparable<K>,V extends Identifiable>	Implementation of a heap-based priority queue.
DefaultHeapNode<K extends Comparable<K>,V extends Identifiable>	A default implementation of an object that can be stored in a heap.
DefaultIdentifiable	Default implementation of the identifiable interface.
MinMaxHeap<K extends Comparable<K>,V extends Identifiable>	A double-ended priority queue implemented as a binary heap.
PersistentHeap<K extends Comparable<K> & Serializable,V extends Identifiable & Serializable>	Persistent implementation of a heap-based priority queue.

Package de.lmu.ifi.dbs.elki.utilities.heap Description

Package collects variants of heap structures.