Summary

This file provides a class definition for a "Heap" - a priority queue implemented as a dense binary tree. The algorithms for manipulating the Heap are taken from code written by Kazimir Majorinc.

A hallmark of this implementation is the flexibility - virtually any definition of "priority" may be used to define the ordering within the queue.

Author: Steve Wampler (sbw@tapestry.tucson.az.us)

This file is in the public domain.

This file is part of the collection package.