Grid Concept for LEDA Graphs ( ConstLedaGraphGridConcept )

Definition

The class ConstLedaGraphGridConcept represents an implementation concept for grid layout algorithms which work on a const LEDA graph G and access the grid layout via an object of type GridLayout. The graph can not be modified by the algorithm. The update() functions remove unnecessary bend points.

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

#include < AGD/ConstLedaGraphGridConcept.h >

Operations

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

const leda_graph&	C.get_graph()	returns the const LEDA graph G.
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.