![]() |
aGrUM
0.20.3
a C++ library for (probabilistic) graphical models
|
Copyright (c) 2005-2021 by Pierre-Henri WUILLEMIN() & Christophe GONZALES() info_at_agrum_dot_org. More...
#include <functional>
#include <initializer_list>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
#include <agrum/agrum.h>
#include <agrum/tools/core/hashTable.h>
#include <agrum/tools/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 | |
Copyright (c) 2005-2021 by Pierre-Henri WUILLEMIN() & Christophe GONZALES() info_at_agrum_dot_org. | |
Macros | |
#define | GUM_MULTIPLE_PRIORITY_QUEUE_DEFAULT_CAPACITY 10 |
Copyright (c) 2005-2021 by Pierre-Henri WUILLEMIN() & Christophe GONZALES() info_at_agrum_dot_org.
This library is free software: you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version.
This library is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public License along with this library. If not, see http://www.gnu.org/licenses/.
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 44 of file multiPriorityQueue.h.