Pseudonode.h

Go to the documentation of this file.

 
#pragma once
 
#include <ogdf/basic/Graph.h>
#include <ogdf/graphalg/matching_blossom/Cycle.h>
#include <ogdf/graphalg/matching_blossom/utils.h>
 
#include <unordered_map>
#include <vector>
 
namespace ogdf {
namespace matching_blossom {
 
class OGDF_EXPORT Pseudonode {
    class ReferenceEdges {
    private:
        std::unordered_map<edge, std::unordered_set<edge>> m_refToSelfLoops;
 
        std::unordered_map<edge, edge> m_selfLoopToRef;
 
        std::unordered_map<edge, Pseudonode*> m_selfLoopToOtherPseudonode;
 
    public:
        ValueIteratorContainer<edge, edge> refEdges;
 
        ReferenceEdges() : refEdges(m_selfLoopToRef) { }
 
        std::unordered_set<edge>& selfLoops(edge ref) { return m_refToSelfLoops[ref]; }
 
        void addReference(edge ref, edge selfLoop, Pseudonode* other) {
            m_refToSelfLoops[ref].insert(selfLoop);
            m_selfLoopToRef[selfLoop] = ref;
            m_selfLoopToOtherPseudonode[selfLoop] = other;
        }
 
        void removeFromOther(edge selfLoop) {
            auto it = m_selfLoopToOtherPseudonode.find(selfLoop);
            if (it != m_selfLoopToOtherPseudonode.end() && it->second != nullptr) {
                auto& otherRefEdges = it->second->referenceEdges;
                auto edgeIt = otherRefEdges.m_selfLoopToRef.find(selfLoop);
                if (edgeIt != otherRefEdges.m_selfLoopToRef.end()) {
                    otherRefEdges.m_refToSelfLoops[edgeIt->second].erase(selfLoop);
                    otherRefEdges.m_selfLoopToRef.erase(edgeIt);
                    otherRefEdges.m_selfLoopToOtherPseudonode.erase(selfLoop);
                }
            }
        }
    };
 
public:
    node graphNode;
 
    Cycle* cycle;
 
    ReferenceEdges referenceEdges;
 
    Pseudonode(node _graphNode, Cycle* _cycle);
 
    ~Pseudonode();
 
    void addReference(edge ref, edge selfLoop, Pseudonode* other);
};
 
}
}