next up previous contents index
Next: Fast Layout of Hierarchies Up: Layout of Hierarchies Previous: Layout of Hierarchies   Contents   Index


Hierarchy Layout Modules ( HierarchyLayoutModule )

Baseclasses


\begin{picture}(7.5,2.5)
\thicklines
\put(0.5,1.5){\framebox (5.5,1){\bf AGDMo...
...,-1){1}}\put(0,0){\framebox (7.5,1){\bf HierarchyLayoutModule}}
\end{picture}

Definition

Modules of type HierarchyLayoutModule compute a layout of a node hierarchy H. H is a hierarchy of a graph GC, which is a copy of a graph G. GC may contain dummy nodes that are not copies of nodes in G. These dummy nodes have degree two and represent edge bends in the final drawing.

Implementing Hierarchy Layout Modules

An implementation of a hierarchy layout module must override the method call(GC,H,A), which gets as input const references to a graph copy GC and a node hierarchy H of GC. It must return the layout in A.

Input and Output Parameters

input parameter: hierarchy in_hierarchy=1
output parameter: layout out_layout=1

The integer constants in_hierarchy and out_layout denote the positions in the input and output parameter lists. The values can be used to reference the desired parameter when setting the pre- and postcondition.

#include < AGD/HierarchyLayoutModule.h >

Initialization

HierarchyLayoutModule L initializes a hierarchy layout module.

Operations

Standard Interface

bool L.check(const GraphCopy& GC, const Hierarchy& H, AgdKey& p)
    returns true if GC satisfies the precondition of L. Otherwise, false is returned, and p contains a property that is not satisfied.

void L.call(const GraphCopy& GC, const Hierarchy& H, LayoutInterface& A)
    implements the module call for graph GC and hierarchy H. Assigns the layout to A.


next up previous contents index
Next: Fast Layout of Hierarchies Up: Layout of Hierarchies Previous: Layout of Hierarchies   Contents   Index

© Copyright 1998-2001, Algorithmic Solutions Software GmbH. All rights reserved.
2001-08-13