Baseclasses
Definition
The MaxAll grid coordinate mapper provides a mapping, which guarantees that the distance between two nodes is at least sep, and that the slopes of edge segments are the same as in the grid layout. Moreover, the computation of the mapping takes time linear in the size of G, the total number of bends and the width and height of the grid layout.
The input grid sizes of nodes ( get_node_gride_size() function) are
Optional Parameters Instances of MaxAllMapper provide the following optional parameters:
#include < AGD/MaxAllMapper.h >
Creation
MaxAllMapper | M(double width = 40, double min_overhang = 2, double sep = 20, DPoint origin = DPoint(0, 0)) | |
creates an instance M of type MaxAllMapper, and sets the optional parameters width, min_overhang, sep and origin. |
Operations
Standard Interface (Inherited Methods) The detailed description of these methods can be found in the manual entries of the base class (GridCoordinateMapper).
void | M.get_node_grid_size(const leda_graph& G, GridLayout& gl, const LayoutInterface& A) | |
void | M.get_node_grid_size(const GraphCopy& GC, GridLayout& gl, const LayoutInterface& A) | |
void | M.call(const leda_graph& G, const GridLayout& gl, LayoutInterface& A) | |
void | M.call(const GraphCopy& GC, const GridLayout& gl, LayoutInterface& A) |
Access to Options
double | M.width() | |
void | M.width(double x) | |
double | M.min_overhang() | |
void | M.min_overhang(double x) | |
double | M.sep() | |
void | M.sep(double x) | |
DPoint | M.origin() | |
void | M.origin(DPoint p) |
Implementation
The get_node_size() function takes time
(n) and
the call() function takes time
(n + m + b), where n is
the number of nodes and m is the number of edges of G, and b is the
total number of bend points.
© Copyright 1998-2001, Algorithmic Solutions Software GmbH. All rights reserved.
2001-08-13