A heap data structure that takes the form of a binary tree which is a common way of implementing priority queues. More...

Inheritance diagram for BinaryHeap< t_comp_type, t_value_type, t_is_min >:

Detailed Description

template<class t_comp_type, class t_value_type, bool t_is_min>
class BinaryHeap< t_comp_type, t_value_type, t_is_min >

A heap data structure that takes the form of a binary tree which is a common way of implementing priority queues.

Definition at line 42 of file BinaryHeap.hpp.

The documentation for this class was generated from the following file: