Uses of Class
ilog.views.graphlayout.hierarchical.IlvNodeGroup

Packages that use IlvNodeGroup

Package	Description
ilog.views.graphlayout.hierarchical	The Hierarchical Layout algorithm arranges the nodes of the graph in horizontal or vertical levels, so that the majority of the links point in the same direction (top-down, left-to-right, and so on).

Uses of IlvNodeGroup in ilog.views.graphlayout.hierarchical

Methods in ilog.views.graphlayout.hierarchical that return IlvNodeGroup

Modifier and Type	Method and Description
IlvNodeGroup	IlvSwimLaneConstraint.getGroup() Returns the group of this constraint.
IlvNodeGroup	IlvSideBySideConstraint.getGroup() Returns the group of this constraint.
IlvNodeGroup	IlvGroupSpreadConstraint.getGroup() Returns the group of this constraint.

Constructors in ilog.views.graphlayout.hierarchical with parameters of type IlvNodeGroup

Constructor and Description
IlvGroupSpreadConstraint(IlvNodeGroup groupArg, int sizeArg) Creates a new IlvGroupSpreadConstraint .
IlvNodeGroup(IlvNodeGroup source) Creates a new IlvNodeGroup by copying an existing one.
IlvSideBySideConstraint(IlvNodeGroup groupArg, float priorityArg) Creates a new IlvSideBySideConstraint .
IlvSwimLaneConstraint(IlvNodeGroup group) Creates a new IlvSwimLaneConstraint.
IlvSwimLaneConstraint(IlvNodeGroup group, double relativeSize, int positionIndex) Creates a new IlvSwimLaneConstraint.
IlvSwimLaneConstraint(IlvNodeGroup group, double relSize, int posIndex, double margin) Creates a new IlvSwimLaneConstraint .
IlvSwimLaneConstraint(IlvNodeGroup group, double relSize, int posIndex, double westMargin, double eastMargin) Creates a new IlvSwimLaneConstraint .