Implementation of an Alternating Tree helper structure for the Blossom algorithm. More...
#include <ogdf/basic/EpsilonTest.h>#include <ogdf/basic/Graph.h>#include <ogdf/basic/List.h>#include <ogdf/basic/basic.h>#include <ogdf/graphalg/matching_blossom/Cycle.h>#include <ogdf/graphalg/matching_blossom/Pseudonode.h>#include <ogdf/graphalg/matching_blossom/utils.h>#include <cstddef>#include <functional>#include <tuple>#include <unordered_map>#include <unordered_set>#include <utility>#include <vector>Go to the source code of this file.
| Classes | |
| class | ogdf::matching_blossom::AlternatingTree< TWeight > | 
| Namespaces | |
| namespace | ogdf | 
| The namespace for all OGDF objects. | |
| namespace | ogdf::matching_blossom | 
Implementation of an Alternating Tree helper structure for the Blossom algorithm.
Definition in file AlternatingTree.h.