LongestPathCompaction.h

Go to the documentation of this file.

 
#pragma once
 
#include <ogdf/basic/Graph.h>
#include <ogdf/basic/SList.h>
#include <ogdf/basic/basic.h>
#include <ogdf/orthogonal/internal/RoutingChannel.h>
 
namespace ogdf {
 
class GridLayoutMapped;
class OrthoRep;
class PlanRep;
template<class ATYPE>
class CompactionConstraintGraph;
 
class OGDF_EXPORT LongestPathCompaction {
public:
    explicit LongestPathCompaction(bool tighten = true, int maxImprovementSteps = 0);
 
    void constructiveHeuristics(PlanRep& PG, OrthoRep& OR, const RoutingChannel<int>& rc,
            GridLayoutMapped& drawing);
 
 
    void improvementHeuristics(PlanRep& 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; 
};
 
}