MatchingModule.h

Go to the documentation of this file.

 
#pragma once
 
#include <ogdf/basic/Graph.h>
#include <ogdf/basic/GraphAttributes.h>
#include <ogdf/basic/GraphCopy.h>
#include <ogdf/basic/GraphList.h>
#include <ogdf/basic/Logger.h>
#include <ogdf/basic/Module.h>
#include <ogdf/basic/basic.h>
#include <ogdf/graphalg/matching_blossom/utils.h>
 
#include <tuple>
#include <unordered_set>
 
namespace ogdf {
 
using namespace matching_blossom;
 
template<typename TWeight>
class MatchingModule : public Module, public Logger {
public:
    virtual ~MatchingModule() { }
 
    bool minimumWeightPerfectMatching(const Graph& G, const EdgeArray<TWeight>& weights,
            std::unordered_set<edge>& matching) {
        return doCall(G, weights, matching);
    }
 
    bool minimumWeightPerfectMatching(const GraphAttributes& GA, std::unordered_set<edge>& matching) {
        return doCall(GA, matching);
    }
 
    std::tuple<bool, TWeight> minimumWeightPerfectMatching(const Graph& G,
            const EdgeArray<TWeight>& weights) {
        std::unordered_set<edge> matching;
        bool result = minimumWeightPerfectMatching(G, weights, matching);
        TWeight weight = matchingWeight(matching, weights);
        return std::make_tuple(result, weight);
    }
 
    std::tuple<bool, TWeight> minimumWeightPerfectMatching(const GraphAttributes& GA) {
        std::unordered_set<edge> matching;
        bool result = minimumWeightPerfectMatching(GA, matching);
        TWeight weight = matchingWeight(matching, GA);
        return std::make_tuple(result, weight);
    }
 
    bool maximumWeightPerfectMatching(const Graph& G, const EdgeArray<TWeight>& weights,
            std::unordered_set<edge>& matching) {
        EdgeArray<TWeight> invertedWeights(G);
        copyWeights(G, weights, invertedWeights, true);
        return doCall(G, invertedWeights, matching);
    }
 
    bool maximumWeightPerfectMatching(const GraphAttributes& GA, std::unordered_set<edge>& matching) {
        const Graph& G = GA.constGraph();
        EdgeArray<TWeight> weights(G);
        copyWeights(G, GA, weights, true);
        return doCall(G, weights, matching);
    }
 
    std::tuple<bool, TWeight> maximumWeightPerfectMatching(const Graph& G,
            const EdgeArray<TWeight>& weights) {
        std::unordered_set<edge> matching;
        bool result = maximumWeightPerfectMatching(G, weights, matching);
        TWeight weight = matchingWeight(matching, weights);
        return std::make_tuple(result, weight);
    }
 
    std::tuple<bool, TWeight> maximumWeightPerfectMatching(const GraphAttributes& GA) {
        std::unordered_set<edge> matching;
        bool result = maximumWeightPerfectMatching(GA, matching);
        TWeight weight = matchingWeight(matching, GA);
        return std::make_tuple(result, weight);
    }
 
    void maximumWeightMatching(const Graph& G, const EdgeArray<TWeight>& weights,
            std::unordered_set<edge>& matching) {
        doMaximumWeightMatching(G, weights, matching);
    }
 
    void maximumWeightMatching(const GraphAttributes& GA, std::unordered_set<edge>& matching) {
        doMaximumWeightMatching(GA.constGraph(), GA, matching);
    }
 
    TWeight maximumWeightMatching(const Graph& G, const EdgeArray<TWeight>& weights) {
        std::unordered_set<edge> matching;
        maximumWeightMatching(G, weights, matching);
        return matchingWeight(matching, weights);
    }
 
    TWeight maximumWeightMatching(const GraphAttributes& GA) {
        std::unordered_set<edge> matching;
        maximumWeightMatching(GA, matching);
        return matchingWeight(matching, GA);
    }
 
    TWeight matchingWeight(const std::unordered_set<edge>& matching,
            const EdgeArray<TWeight>& weights) {
        return getMatchingWeight(matching, weights);
    }
 
    TWeight matchingWeight(const std::unordered_set<edge>& matching, const GraphAttributes& GA) {
        return getMatchingWeight(matching, GA);
    }
 
protected:
    virtual bool doCall(const Graph& G, const EdgeArray<TWeight>& weights,
            std::unordered_set<edge>& matching) = 0;
 
    virtual bool doCall(const GraphAttributes& GA, std::unordered_set<edge>& matching) = 0;
 
private:
    template<class WeightContainer>
    void copyWeights(const Graph& G, const WeightContainer& weights, EdgeArray<TWeight>& copy,
            bool invert = false) {
        for (edge e : G.edges) {
            copy[e] = (invert ? -1 : 1) * getWeight<TWeight>(e, weights);
        }
    }
 
    template<class WeightContainer>
    TWeight getMatchingWeight(const std::unordered_set<edge>& matching,
            const WeightContainer& weights) {
        TWeight value = 0;
        for (edge e : matching) {
            value += getWeight<TWeight>(e, weights);
        }
        return value;
    }
 
    template<class WeightContainer>
    void doMaximumWeightMatching(const Graph& G, const WeightContainer& weights,
            std::unordered_set<edge>& matching) {
        // Duplicate the graph and connect all nodes with their copies with 0-weight edges
        GraphCopySimple graphCopy(G);
        EdgeArray<TWeight> weightsCopy(graphCopy, 0);
        NodeArray<node> nodeMap(graphCopy);
        for (node origNode : G.nodes) {
            node v = graphCopy.copy(origNode);
            node dup = graphCopy.newNode();
            nodeMap[v] = dup;
            graphCopy.newEdge(v, dup);
        }
        for (edge origEdge : G.edges) {
            edge e = graphCopy.copy(origEdge);
            edge newEdge = graphCopy.newEdge(nodeMap[e->source()], nodeMap[e->target()]);
            weightsCopy[newEdge] = weightsCopy[e] = -getWeight<TWeight>(origEdge, weights);
        }
 
        // Calculate the MinimumWeightPerfectMatching on the new graph
        std::unordered_set<edge> matchingCopy;
#ifdef OGDF_DEBUG
        bool result =
#endif
                doCall(graphCopy, weightsCopy, matchingCopy);
        OGDF_ASSERT(result);
 
        // Convert the matching to the original graph
        for (edge e : matchingCopy) {
            if (edge origEdge = graphCopy.original(e)) {
                matching.insert(origEdge);
            }
        }
    };
};
 
}