![]() |
aGrUM
0.14.2
|
Priority queues in which the same element can appear several times. More...
#include <functional>
#include <initializer_list>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
#include <agrum/agrum.h>
#include <agrum/core/hashTable.h>
#include <agrum/core/multiPriorityQueue_tpl.h>
Go to the source code of this file.
Classes | |
class | gum::MultiPriorityQueue< Val, Priority, Cmp, Alloc > |
A MultiPriorityQueue is a heap in which each element has a mutable priority and duplicates are allowedA priority queue is quite similar to a heap except that a priority (a score) is assigned to each element in the structure. More... | |
Namespaces | |
gum | |
gum is the global namespace for all aGrUM entities | |
Macros | |
#define | GUM_MULTIPLE_PRIORITY_QUEUE_DEFAULT_CAPACITY 10 |
Priority queues in which the same element can appear several times.
Definition in file multiPriorityQueue.h.
#define GUM_MULTIPLE_PRIORITY_QUEUE_DEFAULT_CAPACITY 10 |
Definition at line 42 of file multiPriorityQueue.h.