The Cluster-Orthogonal Algorithm ( ClusterOrthogonalLayout )

Baseclasses

Definition

The class ClusterOrthogonalLayout represents the drawing algorithms for c-planar cluster graphs by Lütke-Hüttmann and Mutzel. The input graph has to be c-planar and simple. The produced layout depends on the underlying drawing algorithm for planar graphs, which can be set with the module option base_algorithm. Possible settings are OrthogonalLayout and QuasiOrthogonalLayout.

General Information

Algorithm
name	Cluster-Orthogonal
long name	Cluster-Orthogonal (Lütke-Hüttmann/Mutzel)
author	D. Lütke-Hüttmann, P. Mutzel

Implementation
author	D. Lütke-Hüttmann
date	September 1999
version	1.0

Pre- and Postcondition

precondition	=	{ c - planar, simple, noselfloops }
postcondition(PRE)	=	{ nocrossings }

Exchangeable Modules Instances of type ClusterOrthogonalLayout provide the following module options:

$\bullet$

base_algorithm
a planar grid layout algorithm of type Ovid (e.g., QuasiOrthogonalLayout or OrthogonalLayout) used for the final drawing step.

guaranteed precondition:	{planar, simple, noselfloops}
required postcondition:	{nocrossings}
initial module:	QuaisOrthogonalLayout

#include < AGD/ClusterOrthogonalLayout.h >

Creation

ClusterOrthogonalLayout

L

creates an instance L of type ClusterOrthogonalLayout.

Operations

Standard Interface (Inherited Methods) The detailed description of these methods can be found in the manual entries of the base classes (CGLayoutModule, CGGridLayoutModule).

bool	L.check(const ClusterGraph& CG, AgdKey& p)
void	L.call(const ClusterGraph& CG, CGLayoutInterface& A)
void	L.call(const ClusterGraph& CG, leda_face f_0, CGLayoutInterface& A)
void	L.call_grid(const ClusterGraph& CG, CGGridLayout& cgl)
void	L.call_grid(const ClusterGraph& CG, leda_face f, CGGridLayout& cgl)
IRect	L.bounding_box()
void	L.set_mapper(const GridCoordinateMapper& gcm)

Access to Options

bool

L.set_base_algorithm(const Ovid& M)