This class is based on the enhanced profit model and places the labels of a graph using a simulated annealing
strategy taking into account the amount of overlaps of labels. The algorithm is inspired by the article of
Christensen, Marks and Shieber.
public void setDeterministicModeEnabled(boolean deterministicModeEnabled)
Whether or not this labeling algorithm should work deterministically. In deterministic mode this labeling algorithm
produces the same layout results for the same input graph and layout/labeling parameters.
By default deterministic mode is disabled
setMaximalDuration
public void setMaximalDuration(long msec)
Sets a time limit for the labeling algorithm. Note, that this limit is not strictly observed.
Parameters:
msec - the time in milliseconds
getMaximalDuration
public long getMaximalDuration()
Returns the time limit for the algorithm (in milliseconds).
Note, that this limit is not strictly observed.