Gets a value specifying how important the low number of crossings of links with edges is relatively to the other criteria considered by the algorithm.
Namespace: com.mindfusion.diagramming
Package: com.mindfusion.diagramming
SyntaxJava
 Copy Code
|
|---|
public double getNodeLinkCrossingCost () |
A value added to the total cost of a graph configuration for each crossing of link and node.
See Also