Open
Graph Drawing
Framework

 v.2012.05
 

ogdf::OptimalHierarchyLayout Class Reference

The LP-based hierarchy layout algorithm. More...

#include <ogdf/layered/OptimalHierarchyLayout.h>

Inheritance diagram for ogdf::OptimalHierarchyLayout:
ogdf::HierarchyLayoutModule

List of all members.

Protected Member Functions

void doCall (const Hierarchy &, GraphCopyAttributes &)
 Implements the actual algorithm call.

Detailed Description

The LP-based hierarchy layout algorithm.

OptimalHierarchyLayout implements a hierarchy layout algorithm that is based on an LP-formulation. It is only available if OGDF is compiled with LP-solver support (e.g., Coin).

The used model avoids Spaghetti-effect like routing of edges by using long vertical segments as in FastHierarchyLayout. An additional balancing can be used which balances the successors below a node.

Optional parameters

OptionTypeDefaultDescription
nodeDistancedouble3.0 The minimal allowed x-distance between nodes on a layer.
layerDistancedouble3.0 The minimal allowed y-distance between layers.
fixedLayerDistanceboolfalse If set to true, the distance between neighboured layers is always layerDistance; otherwise the distance is adjusted (increased) to improve readability.
weightSegmentsdouble2.0 The weight of edge segments connecting to vertical segments.
weightBalancingdouble0.1 The weight for balancing successors below a node; 0.0 means no balancing.

Definition at line 93 of file OptimalHierarchyLayout.h.


Member Function Documentation

void ogdf::OptimalHierarchyLayout::doCall ( const Hierarchy H,
GraphCopyAttributes AGC 
) [inline, protected, virtual]

Implements the actual algorithm call.

Must be implemented by derived classes.

Parameters:
His the input hierarchy.
AGChas to be assigned the hierarchy layout.

Implements ogdf::HierarchyLayoutModule.

Definition at line 97 of file OptimalHierarchyLayout.h.


The documentation for this class was generated from the following file: