Gets a value specifying the importance of the distance between nodes and links relative to the other criteria considered by the algorithm.
Namespace: com.mindfusion.diagramming
Package: com.mindfusion.diagramming
Java
![]() |
---|
public double getNodeLinkDistFactor () |
A multiplier applied to the node-to-link distance cost when evaluating the total cost of a graph configuration.