-
Class Summary Class Description IlvShortLinkLayout This class is the main class for the Short Link Layout algorithm.
Package ilog.views.graphlayout.link.shortlink Description
The Short Link Layout algorithm reshapes the links of a graph without moving
the nodes.
The algorithm tries to avoid crossings and overlaps of links and nodes
by a penalty mechanism. It tests only a limited number of link shapes.
Long links can cause overlaps with nodes or other links.
This algorithm is suitable, if overlaps are no fatal layout errors, or if the links are short. Otherwise the Long Link Layout algorithm may be more suitable.
By default, the algorithm computes orthogonal links; that is, links composed of alternating horizontal and vertical segments. Optionally, direct links can be computed. Both link styles can be mixed in the same drawing.
Sample drawing produced by the Short Link Layout:
- Since:
- JViews3.5
- See Also:
ilog.views.graphlayout