|
|||
|
|
|
|||
|
|
The LP-based hierarchy cluster layout algorithm. More...
#include <ogdf/layered/OptimalHierarchyClusterLayout.h>
Protected Member Functions | |
| void | doCall (const ExtendedNestingGraph &H, ClusterGraphCopyAttributes &ACGC) |
| Implements the actual algorithm call. | |
The LP-based hierarchy cluster layout algorithm.
OptimalHierarchyClusterLayout implements a hierarchy layout algorithm fpr cluster graphs 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.
| Option | Type | Default | Description |
|---|---|---|---|
| nodeDistance | double | 3.0 | The minimal allowed x-distance between nodes on a layer. |
| layerDistance | double | 3.0 | The minimal allowed y-distance between layers. |
| fixedLayerDistance | bool | false | If set to true, the distance between neighboured layers is always layerDistance; otherwise the distance is adjusted (increased) to improve readability. |
| weightSegments | double | 2.0 | The weight of edge segments connecting to vertical segments. |
| weightBalancing | double | 0.1 | The weight for balancing successors below a node; 0.0 means no balancing. |
| weightClusters | double | 0.05 | The weight for cluster boundary variables. |
Definition at line 97 of file OptimalHierarchyClusterLayout.h.
| void ogdf::OptimalHierarchyClusterLayout::doCall | ( | const ExtendedNestingGraph & | H, |
| ClusterGraphCopyAttributes & | ACGC | ||
| ) | [inline, protected, virtual] |
Implements the actual algorithm call.
Must be implemented by derived classes.
| H | is the input clustered hierarchy. |
| ACGC | has to be assigned the cluster hierarchy layout. |
Implements ogdf::HierarchyClusterLayoutModule.
Definition at line 101 of file OptimalHierarchyClusterLayout.h.
