C++ Reference: integer_pq

This documentation is automatically generated.

This file contains and adjustable priority queue templated by an Element class that must:
   - Be efficiently copiable and storable in a std::vector<Element>.
   - Be comparable via the templated Compare class. Top() will returns
   the element with the largest priority (like std::priority_queue).
   - Implements the "int Index() const" function that must returns an integer
   that uniquely identify this particular element. Ideally this index must
   be dense in [0, max_num_elements).

Classes

IntegerPriorityQueue

Send feedback about...