PriorityQueue_t< T, A > Struct Template Reference

Basic structure for a priority queue. More...

#include <structures.hpp>

List of all members.

Public Types
typedef std::map< T, std::vector< A > >	Type

---

Detailed Description

template<class T, class A>
struct PriorityQueue_t< T, A >

Basic structure for a priority queue.

This is the ground of our priority queue's definition. Type 'map' of the STL uses a red-black tree assuring a logarithmic time complexity. We use that kind of tree (binary search tree) instead of the traditional heap to be able to search for a element in a logarithmic way (heaps make it linear).

Definition at line 86 of file structures.hpp.

---

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

• structures.hpp