Algorithm
Development Kit 1.0

Package algs.model.heap

Core set of classes to implement Binary Heaps.

See:
          Description

Class Summary
BinaryHeap<E extends Comparable<E>> A Binary Heap that can be used as a Priority Queue since it enables elements to have its priority updated while in queue.
ExternalBinaryHeap<E> Declared as 'External' since all comparison is external via a provided comparator class.
HeapSort<E> Implementation of HeapSort using BinaryHeap.
 

Package algs.model.heap Description

Core set of classes to implement Binary Heaps.


Algorithm Development Kit 1.0

This code supports the Algorithms in a Nutshell book, published by O'Reilly Media, Inc. in November 2008. Please visit the book web page to learn of any changes to the code repository or to record a potential defect.