Grid Concept for Graph Copies ( GraphCopyGridConcept )

Definition

The class GraphCopyGridConcept represents an implementation concept for grid layout algorithms which work on a graph copy GC and access the grid layout via an object of type GridLayout. The graph copy can be modified by the algorithm. The following transformations are performed by the update functions:

• The polylines of reversed edges are reversed.
• The polylines of splitted edges are concatenated.
• Unnecessary bend points are removed.

A computed bounding box can be passed to the grid concept using set_bbox(). Otherwise, the bounding box is computed on demand.

#include < AGD/GraphCopyGridConcept.h >

Operations

GraphCopyGridConcept implements the constructors and operations which are required for template argument GRID_CONCEPT of GridLayoutModuleImpl. Furthermore, the following operations are provided:

GraphCopy&	C.get_graph()	returns the graph copy GC.
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.