Versions Compared

Key

  • This line was added.
  • This line was removed.
  • Formatting was changed.

...

OptionIDTypeApplies toDefaultDependency
Crossing Minimizationde.cau.cs.kieler.klay.layered.crossMinEnumParentsLAYER_SWEEP 
Cycle Breakingde.cau.cs.kieler.klay.layered.cycleBreakingEnumParentsGREEDY 
Edge Spacing Factorde.cau.cs.kieler.klay.layered.edgeSpacingFactorFloatParents0.5 
Feedback Edgesde.cau.cs.kieler.klay.layered.feedBackEdgesBooleanParentsfalse 
Fixed Alignmentde.cau.cs.kieler.klay.layered.fixedAlignmentEnumParentsNONE 
Interactive Reference Pointde.cau.cs.kieler.klay.layered.interactiveReferencePointEnumParentsCENTER 
Label Sidede.cau.cs.kieler.klay.layered.LabelSideEnumParentsSMART 
Layer Constraintde.cau.cs.kieler.klay.layered.layerConstraintEnumNodesNONE 
Maximal Iterationsde.cau.cs.kieler.klay.layered.nodeLayeringIntParents10.000.000nodeLayering=NETWORK_SIMPLEX
Merge Edgesde.cau.cs.kieler.klay.layered.mergePortsBooleanParentsfalse 
Node Layeringde.cau.cs.kieler.klay.layered.nodeLayeringEnumParentsNETWORK_SIMPLEX 
Node Placementde.cau.cs.kieler.klay.layered.nodePlaceEnumParentsBRANDES_KOEPF 
Port Anchor Offsetde.cau.cs.kieler.klay.layered.portAnchorObjectPorts  
Thoroughnessde.cau.cs.kieler.klay.layered.thoroughnessIntParents7 

The Most Important Options

...

  • TOP_LEFT
    The top left corner of a node is taken as the reference point.
  • CENTER
    The center of a node is taken as the reference point.

 

Maximal Iterations

Anchor
networkSimplexMaxIterations
networkSimplexMaxIterations

Delimits the amount of depth-first-search iterations performed by the network simplex layering strategy. Large, highly connected graphs might require a long time to be processed. This property serves as a timeout after which an exception is raised.

Thoroughness

Anchor
thoroughness
thoroughness

...