RadialTreeLayout.h

Go to the documentation of this file.

 
#pragma once
 
#include <ogdf/basic/LayoutModule.h>
#include <ogdf/basic/SList.h>
 
namespace ogdf {
 
 
class OGDF_EXPORT RadialTreeLayout : public LayoutModule {
public:
    enum class RootSelectionType {
        Source, 
        Sink, 
        Center 
    };
 
private:
    double m_levelDistance; 
 
    RootSelectionType m_selectRoot; 
 
    node m_root; 
 
    int m_numLevels; 
    NodeArray<int> m_level; 
    NodeArray<node> m_parent; 
    Array<SListPure<node>> m_nodes; 
    NodeArray<SListPure<node>> m_children; 
 
    NodeArray<double> m_relWidth; 
 
    NodeArray<double> m_absWidth; 
 
    NodeArray<double> m_angle; 
    NodeArray<double> m_wedge; 
 
    NodeArray<double> m_diameter; 
    Array<double> m_maxDiameter; 
 
    Array<double> m_radius; 
 
public:
    RadialTreeLayout();
 
    RadialTreeLayout(const RadialTreeLayout& tl);
 
    ~RadialTreeLayout() = default;
 
    RadialTreeLayout& operator=(const RadialTreeLayout& tl);
 
 
    virtual void call(GraphAttributes& GA) override;
 
    // option that determines the minimal vertical distance
    // required between levels
 
    double levelDistance() const { return m_levelDistance; }
 
    void levelDistance(double x) { m_levelDistance = x; }
 
    // option that determines if the root is on the top or on the bottom
 
    RootSelectionType rootSelection() const { return m_selectRoot; }
 
    void rootSelection(RootSelectionType sel) { m_selectRoot = sel; }
 
    const NodeArray<double>& diameter() const { return m_diameter; }
 
private:
    void FindRoot(const Graph& G);
    void ComputeLevels(const Graph& G);
    void ComputeDiameters(GraphAttributes& AG);
    void ComputeAngles(const Graph& G);
    void ComputeCoordinates(GraphAttributes& AG);
    void ComputeGroupings(const Graph& G);
 
    OGDF_NEW_DELETE
};
 
}