DominanceLayout.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) $ 
 ***************************************************************/
 
//***
// Dominance Drawing Method. see "Graph Drawing" by Di Battista et al.
//***



#ifdef _MSC_VER
#pragma once
#endif

#ifndef OGDF_DOMINANCE_LAYOUT_H
#define OGDF_DOMINANCE_LAYOUT_H


#include <ogdf/module/LayoutModule.h>
#include <ogdf/basic/ModuleOption.h>
#include <ogdf/module/UpwardPlanarizerModule.h>
#include <ogdf/upward/UpwardPlanRep.h>
#include <ogdf/basic/GraphAttributes.h>
#include <ogdf/upward/SubgraphUpwardPlanarizer.h>

namespace ogdf {


class DominanceLayout : public LayoutModule
{
public:

    DominanceLayout() {
        m_grid_dist = 1;
        // set default module       
        m_upPlanarizer.set(new SubgraphUpwardPlanarizer()); 
    
        m_angle = 45.0/180.0*3.1415926535; 

    }   

    virtual void call(GraphAttributes &GA);

    void layout(GraphAttributes &GA, const UpwardPlanRep &UPROrig);
    
    void setUpwardPlanarizer(UpwardPlanarizerModule *upPlanarizer) {
        m_upPlanarizer.set(upPlanarizer);
    }

    void setMinGridDistance(int dist) {m_grid_dist = dist;}



private:

    double m_angle; //rotate angle to obtain an upward drawing; default is 45°

    NodeArray<edge> firstout;
    NodeArray<edge> lastout;
    NodeArray<edge> firstin;
    NodeArray<edge> lastin;

    int m_R;
    int m_L;

    // list of nodes sorted by their x and y coordinate.
    List<node> xNodes;
    List<node> yNodes;

    //coordinate in preliminary layout
    NodeArray<int> xPreCoord;
    NodeArray<int> yPreCoord;

    //final coordinate  of the nodes of the UPR
    NodeArray<int> xCoord;
    NodeArray<int> yCoord;

    
    //min grid distance
    int m_grid_dist;

    ModuleOption<UpwardPlanarizerModule> m_upPlanarizer; // upward planarizer
        
    void labelX(const UpwardPlanRep &UPR, node v, int &count);

    void labelY(const UpwardPlanRep &UPR, node v, int &count);

    void compact(const UpwardPlanRep &UPR, GraphAttributes &GA);

    void findTransitiveEdges(const UpwardPlanRep &UPR, List<edge> &edges);

};


}//namespace

#endif