Next: Grid Concept for Plane Up: Implementation of Layout Algorithms Previous: Grid Concept for Orthogonal Contents Index

Implementation of Clustergraph Grid Layout Algorithms ( CGGridLayoutModuleImpl )

Baseclasses

$\begin{picture}(11,5.5) \thicklines \put(4,4.5){\framebox (5,1){\bf AGDModule}... ...x (14.5,1){\bf CGGridLayoutModuleImpl{\tt <}GRID\_CONCEPT{\tt >}}} \end{picture}$

Definition

The class CGGridLayoutModuleImpl< GRID_CONCEPT > represents a generic method for implementing grid layout algorithms for clustergraphs. For a detailed description take a look at the section for the GridLayoutModuleImpl class.

#include < AGD/CGGridLayoutModuleImpl.h >

Operations

CGGridLayoutModuleImpl< GRID_CONCEPT > implements the call() and call_grid() methods of its base classes. Furthermore, there are the following protected overridables:

void L.do_call(GRID_CONCEPT& C)

implements the algorithm.

void L.get_node_grid_size(GRID_CONCEPT& C, const LayoutInterface& A)

determines initial grid sizes of nodes. The default implementation calls C.get_node_grid_size() with the current grid coordinate mapper.

void L.get_node_grid_size(GRID_CONCEPT& C, const GridLayout& gl)

determines initial grid sizes of nodes. The grid sizes in gl represent the user's input. The default implementation calls C.get_node_grid_size() with gl.

Next: Grid Concept for Plane Up: Implementation of Layout Algorithms Previous: Grid Concept for Orthogonal Contents Index

void	L.do_call(GRID_CONCEPT& C)
		implements the algorithm.
void	L.get_node_grid_size(GRID_CONCEPT& C, const LayoutInterface& A)
		determines initial grid sizes of nodes. The default implementation calls C.get_node_grid_size() with the current grid coordinate mapper.
void	L.get_node_grid_size(GRID_CONCEPT& C, const GridLayout& gl)
		determines initial grid sizes of nodes. The grid sizes in gl represent the user's input. The default implementation calls C.get_node_grid_size() with gl.