Package ilog.views.graphlayout.link.longlink

The Long Link Layout algorithm reshapes the links of a graph without moving the nodes.

See: Description

Interface Summary

Interface	Description
IlvTerminationPointFilter	An interface used to define complex requirements concerning the connection of the links to specific point at the nodes.

Class Summary

Class	Description
IlvLongLinkLayout	The main class for the Long Link Layout algorithm.
IlvLongLinkLayoutGrapherProperty	The class IlvLongLinkLayoutGrapherProperty allows you to store the global settings of an instance of IlvLongLinkLayout as a named property in the grapher.
IlvLongLinkLayoutLinkProperty	The class IlvLongLinkLayoutLinkProperty allows you to store the settings of an instance of IlvLongLinkLayout for an individual link as a named property in the link.
IlvLongLinkLayoutReport	The class used to store information about the behavior of the Orthogonal Long Link Layout algorithm.

Package ilog.views.graphlayout.link.longlink Description

The Long Link Layout algorithm reshapes the links of a graph without moving the nodes. It is specialized to route long orthogonal links on a grid without overlapping nodes. It uses a classical path search mechanism, and an additional crossing reduction phase.

This algorithm is suitable, if routing on the grid is preferred and many long orthogonal links exist that should not overlap any node. Otherwise the Short 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 Link Layout in long link mode:

Click on the image to see it in normal size.

The long link mode can find a route through a labyrinth:

Click on the image to see it in normal size.

Since:

JViews 3.5

See Also:

ilog.views.graphlayout