An extension of the standard priority queue with additional features. More...
#include <ogdf/basic/PriorityQueue.h>
#include <ogdf/basic/basic.h>
#include <ogdf/basic/heap/PairingHeap.h>
#include <ogdf/graphalg/matching_blossom/utils.h>
#include <functional>
#include <unordered_map>
Go to the source code of this file.
Classes | |
class | ogdf::matching_blossom::BlossomPQ< E, TWeight, C, Impl > |
A custom priority queue for the blossom algorithm, based on the PrioritizedMapQueue. It uses a std::unordered_map to store the handles, handles merge operations correctly, can iterate over its elements and offers a remove() function. More... | |
Namespaces | |
ogdf | |
The namespace for all OGDF objects. | |
ogdf::matching_blossom | |
An extension of the standard priority queue with additional features.
Definition in file PQ.h.