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

Grid Concept for Orthogonal Representations ( OrthoRepGridConcept )

Baseclasses

$\begin{picture}(12.5,2.5) \thicklines \put(0,1.5){\framebox (9.5,1){\bf Plane... ...(0,-1){1}} \put(4,0){\framebox (7,1){\bf OrthoRepGridConcept}} \end{picture}$

Definition

The class OrthoRepGridConcept represents an implementation concept for grid layout algorithms which work on an orthogonal representation and access the grid layout via an object of type GridLayout. The graph is stored as an orthogonal representation H, which can be modified by the algorithm.

#include < AGD/OrthoRepGridConcept.h >

Operations

OrthoRepGridConcept implements the constructors and operations which are required for template argument GRID_CONCEPT of GridLayoutModuleImpl. Furthermore, the following operations are provided: The class inherits all the operations from PlaneGraphCopyGridConcept. Additionally, it provides the following operation:

OrthogonalRepresentation& C.get_representation() returns the orthogonal representation H.

GridLayout& C.get_layout() returns the grid layout of G.

void C.set_zero_size() sets the grid width and height of all nodes to 0.

void C.set_bbox(const IRect& bbox)

sets the bounding box of the grid layout to bbox.

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

OrthogonalRepresentation&	C.get_representation()	returns the orthogonal representation H.
GridLayout&	C.get_layout()	returns the grid layout of G.
void	C.set_zero_size()	sets the grid width and height of all nodes to 0.
void	C.set_bbox(const IRect& bbox)
		sets the bounding box of the grid layout to bbox.