Implementation of the original Blossom algorithm by Edmonds (1965). More...
#include <ogdf/basic/Graph.h>
#include <ogdf/basic/GraphAttributes.h>
#include <ogdf/basic/GraphList.h>
#include <ogdf/basic/Logger.h>
#include <ogdf/basic/basic.h>
#include <ogdf/graphalg/MatchingModule.h>
#include <ogdf/graphalg/matching_blossom/AlternatingTree.h>
#include <ogdf/graphalg/matching_blossom/BlossomHelper.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 <iostream>
#include <memory>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <vector>
Go to the source code of this file.
Classes | |
class | ogdf::MatchingBlossom< TWeight > |
Implementation of the Blossom-I algorithm by Edmonds (1965) for Minimum Weight Perfect Matching. More... | |
Namespaces | |
ogdf | |
The namespace for all OGDF objects. | |
Implementation of the original Blossom algorithm by Edmonds (1965).
Definition in file MatchingBlossom.h.