LongestPathCompaction.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) $ 
 ***************************************************************/
 
#ifdef _MSC_VER
#pragma once
#endif


#ifndef OGDF_LONGEST_PATH_COMPACTION_H
#define OGDF_LONGEST_PATH_COMPACTION_H


#include <ogdf/orthogonal/OrthoRep.h>
#include <ogdf/planarity/PlanRepUML.h>
#include <ogdf/internal/orthogonal/RoutingChannel.h>
#include <ogdf/basic/tuples.h>
#include <ogdf/basic/GridLayoutMapped.h>


namespace ogdf {

    template<class ATYPE> class CompactionConstraintGraph;
    class OGDF_EXPORT Layout;


class OGDF_EXPORT LongestPathCompaction
{
public:
    LongestPathCompaction(bool tighten = true,
        int maxImprovementSteps = 0);

    void constructiveHeuristics(
        PlanRepUML &PG,
        OrthoRep &OR,
        const RoutingChannel<int> &rc,
        GridLayoutMapped &drawing);


    void improvementHeuristics(
        PlanRepUML &PG,
        OrthoRep &OR,
        const RoutingChannel<int> &rc,
        GridLayoutMapped &drawing);

    //
    // options

    void tighten(bool select) {
        m_tighten = select;
    }

    bool tighten() const {
        return m_tighten;
    }


    void maxImprovementSteps(int maxSteps) {
        m_maxImprovementSteps = maxSteps;
    }

    int maxImprovementSteps() const {
        return m_maxImprovementSteps;
    }


private:
    void computeCoords(
        const CompactionConstraintGraph<int> &D,
        NodeArray<int> &pos);

    void applyLongestPaths(const CompactionConstraintGraph<int> &D,
        NodeArray<int> &pos);

    void moveComponents(const CompactionConstraintGraph<int> &D,
        NodeArray<int> &pos);


    // options
    bool m_tighten;  
    int m_maxImprovementSteps; 

    SList<node>    m_pseudoSources; 
    NodeArray<int> m_component;     
};


} // end namespace ogdf


#endif