next up previous contents index
Next: Planarization-Based Layout Methods Up: Layout Algorithms Previous: Cluster Graph Layout Algorithms   Contents   Index


Cluster Graph Grid Layout Algorithms ( CGGridLayoutModule )

Baseclasses


\begin{picture}(8,4)
\thicklines
\put(0,3){\framebox (5,1){\bf AGDModule}}\...
...tor(0,-1){1}}\put(2,0){\framebox (7,1){\bf CGGridLayoutModule}}
\end{picture}

Definition

The class CGGridLayoutModule extends the standard interface of cluster graph layout algorithms by specialized call functions for cluster graph grid layout algorithms.

Exchangeable Modules Each cluster graph grid layout algorithm has a module option for its grid coordinate mapper. Deriving classes must also copy the mapper option when implementing the clone method.

$ \bullet$
mapper
a GridCoordinateMapper option used for translating grid coordinates into real coordinates.

guaranteed precondition: $ \emptyset$
required postcondition: $ \emptyset$
initial module: MaxAllMapper

#include < AGD/CGGridLayoutModule.h >

Initialization

CGGridLayoutModule L initializes a cluster graph grid layout module. Sets the cluster graph grid coordinate mapper to MaxAllMapper.

CGGridLayoutModule L(const PreCond& P, const PostCond& Q, const GridCoordinateMapper& M)
    initializes a cluster graph grid layout module. Sets the cluster graph grid coordinate mapper to M.

Operations

Extended Standard Interface

void L.call_grid(const ClusterGraph& CG, CGGridLayout& cgl)
    calls L for cluster graph CG. Returns the cluster graph grid layout in cgl.

void L.call_grid(const ClusterGraph& CG, leda_face f, CGGridLayout& cgl)
    calls L for cluster graph CG and external face f. Returns the cluster graph grid layout in cgl. Precondition: G represents a planar map, and f is nil or a face in CG.


next up previous contents index
Next: Planarization-Based Layout Methods Up: Layout Algorithms Previous: Cluster Graph Layout Algorithms   Contents   Index

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