![]() |
Home | Libraries | People | FAQ | More |
The header heap.hpp provides a set of different priority queue implementations. The interface of all classes is an extended version of the priority queue supported by the standard library: The priority queues are extended to support modification of arbitrary elements and to provide access to all elements currently stored in the priority queue. The priority queues implemented include a d-heap, a Fibonacci heap, a pairing heap, and a splay heap. Also included are implementations of a stack and queue which share the same interface as the other priority classes.
Revised July 17, 1999