The FL algorithm

This layout algorithm iteratively searches for a configuration of the graph where the length of the links is close to a user-defined or a default value.
Example of FL algorithm
The following code sample uses the ibm_ilog.graphlayout.forcedirected.ForceDirectedLayout class. This code sample shows how to perform a Force-directed Layout:
var forceDirectedLayout = new ibm_ilog.graphlayout.forcedirected.ForceDirectedLayout();
graph.setNodeLayout(forceDirectedLayout);
graph.performGraphLayout();
Important
All explanations in the subsequent sections regarding the shape of the links in Force-directed Layout are valid only if the link layout is disabled.