Next: Cluster Graph Grid Layout Up: Layout Algorithms Previous: Grid Layout Algorithms ( Contents Index

Cluster Graph Layout Algorithms ( CGLayoutModule )

Baseclasses

$\begin{picture}(6.5,2.5) \thicklines \put(0,1.5){\framebox (5,1){\bf AGDModule... ...ector(0,-1){1}}\put(1.0,0){\framebox (6,1){\bf CGLayoutModule}} \end{picture}$

Definition

The class CGLayoutModule defines the standard interface for layout algorithms that draw cluster graphs. A cluster graph is a graph with an additional cluster structure.

Such a layout algorithm L gets as input a cluster graph CG and for each node v of CG the size of the rectangle surrounding the graphics of v. L computes for each node v a point, which will be the center of the graphics of v, for each edge a list of bend points with a source and target anchor point, and for each cluster a rectangular bounding region. Layout algorithms are also allowed to change the size of the graphics of nodes.

Input and Output Parameters

input parameter: graph in_graph=1

output parameter: layout out_layout=1

The integer constants in_graph 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/CGLayoutModule.h >

Initialization

CGLayoutModule L initializes a layout algorithm.

Operations

bool L.check(const ClusterGraph& CG, AgdKey& p)

returns true if G satisfies the preconditions of L. Otherwise, false is returned and p contains a property that is not satisfied.

void L.call(const ClusterGraph& CG, CGLayoutInterface& A)

calls L for cluster graph CG with cluster graph layout interface A. Precondition: A is a layout interface for cluster graph CG.

void L.call(const ClusterGraph& CG, leda_face f_0, CGLayoutInterface& A)

calls L for cluster graph CG with cluster graph layout interface A. Precondition: CG represents a planar map, f is nil or a face in CG, and A is a layout interface for cluster graph CG.

Next: Cluster Graph Grid Layout Up: Layout Algorithms Previous: Grid Layout Algorithms ( Contents Index

input parameter:	graph	in_graph=1
output parameter:	layout	out_layout=1

bool	L.check(const ClusterGraph& CG, AgdKey& p)
		returns true if G satisfies the preconditions of L. Otherwise, false is returned and p contains a property that is not satisfied.
void	L.call(const ClusterGraph& CG, CGLayoutInterface& A)
		calls L for cluster graph CG with cluster graph layout interface A. Precondition: A is a layout interface for cluster graph CG.
void	L.call(const ClusterGraph& CG, leda_face f_0, CGLayoutInterface& A)
		calls L for cluster graph CG with cluster graph layout interface A. Precondition: CG represents a planar map, f is nil or a face in CG, and A is a layout interface for cluster graph CG.