The computation of a layout on a large graph may require a large amount of memory. Some layout algorithms optionally use two ways to store data: one which gives the priority to speed (this is the default case), the other which consumes less memory and is probably slower. The amount of memory savings depends, of course, on the implementation of the subclass of IlvGraphLayout. No matter which option you choose for memory savings, the resulting layout should be the same.

To specify your option, use the following method:

and to obtain the current value:

The default value is IlFalse.

To indicate whether a subclass of IlvGraphLayout supports this mechanism, the following method is provided:

The default implementation returns IlFalse. A subclass can override this method in order to return IlTrue to indicate that this mechanism is supported.