MMCrossingMinimizationModule.h

Go to the documentation of this file.

/*
 * $Revision: 2299 $
 * 
 * last checkin:
 *   $Author: gutwenger $ 
 *   $Date: 2012-05-07 15:57:08 +0200 (Mon, 07 May 2012) $ 
 ***************************************************************/
 
#ifndef OGDF_MM_CROSSING_MINIMIZATION_MODULE_H
#define OGDF_MM_CROSSING_MINIMIZATION_MODULE_H



#include <ogdf/planarity/PlanRepExpansion.h>
#include <ogdf/basic/Module.h>
#include <ogdf/basic/Logger.h>


namespace ogdf {

class OGDF_EXPORT MMCrossingMinimizationModule : public Module
{
public:
    MMCrossingMinimizationModule() { m_nodeSplits = 0; }

    // destruction
    virtual ~MMCrossingMinimizationModule() { }

    ReturnType call(PlanRepExpansion &PG,
            int cc,
            int&  crossingNumber,
            const EdgeArray<bool> *forbid = 0)
    {
        return doCall(PG, cc, forbid, crossingNumber, m_nodeSplits, m_splittedNodes);
    };

    ReturnType call(const Graph &G, int &cr, const EdgeArray<bool> *forbid = 0);

    ReturnType call(const Graph &G,
        const List<node> &splittableNodes,
        int &cr,
        const EdgeArray<bool> *forbid = 0);

    int numberOfNodeSplits() const { return m_nodeSplits; }

    int numberOfSplittedNodes() const { return m_splittedNodes; }

protected:
    virtual ReturnType doCall(PlanRepExpansion &PG,
        int cc,
        const EdgeArray<bool> *forbid, 
        int& crossingNumber,
        int& numNS,
        int& numSN) = 0;

private:
    int m_nodeSplits;    
    int m_splittedNodes; 

    OGDF_MALLOC_NEW_DELETE
};

} // end namespace ogdf

#endif