Resolved Layout Algorithm

Property	Value
Type:	programmatic
Identifier:	`org.eclipse.elk.resolvedAlgorithm`
Meta Data Provider:	`core.options.CoreOptions`
Value Type:	`org.eclipse.elk.core.data.LayoutAlgorithmData`
Applies To:	parents

Description

Meta data associated with the selected algorithm.

Algorithms

ELK Rectangle Packing

ELK SPOrE Compaction

ELK SPOrE Overlap Removal

Activate Inside Self Loops

Adapt Port Positions

Add Unnecessary Bendpoints

Additional Port Space

Additional Wedge Space

Additional Wrapped Edges Spacing

Alignment

Allow Non-Flow Ports To Switch Sides

Angle Penalty

Animate

Animation Time Factor

Annulus Wedge Criteria

Aspect Ratio

Bend Points

BK Edge Straightening

Cluster Crossing Penalty

Comment Box

Comment Comment Spacing

Comment Node Spacing

Compaction

Compaction iterations

Connected Components Compaction

Connected Components Compaction Strategy

Connected Components Layout Algorithm

Consider Model Order

Consider Model Order for Components

Consider Port Order

Content Alignment

Correction Factor for Wrapping

Cost Function for Spanning Tree

Crossing Counter Node Order Influence

Crossing Counter Port Order Influence

Crossing Minimization Strategy

Crossing Penalty

Current position of a node in the order of nodes

Cutting Strategy

Cycle Breaking Strategy

DCGraph

Debug Mode

Desired Edge Length

Desired index of node

Distance Penalty When Improving Cuts

Eades Repulsion

Edge Center Label Placement Strategy

Edge Edge Between Layer Spacing

Edge End Texture Length

Edge Label Placement

Edge Label Side Selection

Edge Label Spacing

Edge Node Between Layers Spacing

Enable Hyperedges From Common Source

Epsilon

Expand Nodes

Favor Straight Edges Over Balancing

Fixed Shared Path Penalty

Font Name

Font Size

Force Model

Force Node Model Order

FR Temperature

Generate Position and Layer IDs

Graph Wrapping Strategy

Greedy Switch Activation Threshold

Greedy Switch Crossing Minimization

Greedy Switch Crossing Minimization (hierarchical)

Hierarchical Sweepiness

Hierarchy Handling

Hierarchy Handling (Graphviz Dot)

High Degree Node Maximum Tree Height

High Degree Node Threshold

High Degree Node Treatment

Horizontal spacing between Label and Port

Hypernode

Ideal Nudging Distance

Improve Cuts

Improve Hyperedge Routes

Improve Hyperedge Routes Add/Delete

Improve Wrapped Edges

In Layer Predecessor of

In Layer Successor of

In new Row

Individual Spacing

Individual Spacing (ELK Layered)

Interactive Reference Point

Layer Choice Constraint

Linear Segments Deflection Dampening

List of Polyominoes

Long Edge Ordering Strategy

Manually Specified Cuts

Margins

Marks a node as a cluster

Max Node Promotion Iterations

Max. Iterations

Maximal Animation Time

Merge Edges

Merge Hierarchy-Crossing Edges

Minimal Animation Time

MSD Freedom

No Layout

No Model Order

Node arrangement strategy

Node Flexibility

Node Flexibility Default

Node Label Padding

Node Label Placement

Node Layering Strategy

Node Node Between Layers Spacing

Node Placement Strategy

Node Promotion Strategy

Node Self Loop Spacing

Node Size Constraints

Node Size Minimum

Node Size Options

Node Spacing

Nudge Orthogonal Segments

Nudge Orthogonal Touching Colinear Segments

Nudge Shared Paths With Common Endpoint

Omit Node Micro Layout

Optimization Goal

Order ID

Orthogonal Compaction

Outgoing Edge Angles

Overlap Removal

Padding

Penalise Orthogonal Shared Paths

Perform Unifying Nudging Preprocessing

Polyomino Primary Sorting Criterion

Polyomino Secondary Sorting Criterion

Polyomino Traversal Strategy

Port Alignment

Port Alignment (East)

Port Alignment (North)

Port Alignment (South)

Port Alignment (West)

Port Anchor Offset

Port Border Offset

Port Constraints

Port Direction Penalty

Port Index

Port Label Placement

Port Labels Next to Port

Port Side

Port Sorting Strategy

Port Spacing

Position

Position Choice Constraint

Position Constraint

Position ID

Post Compaction Constraint Calculation

Post Compaction Strategy

Priority

Priority (ELK Box)

Priority (ELK Force)

Priority (ELK Layered)

Priority (ELK Mr. Tree)

Resolved Layout Algorithm

Reverse Direction Penalty

Root node for spanning tree construction

Root selection for spanning tree

Rotate

Row Height Reevaluation

Scale Factor

Search Order

Segment Penalty

Self-Loop Distribution

Self-Loop Ordering

Semi-Interactive Crossing Minimization

Separate Connected Components

Shape Buffer Distance

Shift Last Placed.

Shortness Priority

Shortness Priority (ELK Layered)

Sloped Edge Zone Width

Sloppy Spline Layer Spacing Factor

Sorter

Spacing Base Value

Spline Routing Mode

Straightness Priority

Stress Epsilon

Structure Extraction Strategy

Target Angle

Target Width

Thoroughness

Topdown Hierarchical Node Aspect Ratio

Topdown Hierarchical Node Width

Topdown Size Approximator

Translation Optimization

Treat Port Labels as Group

Tree Construction Strategy

Tree Level

Try box layout first

Underlying Layout Algorithm

Upper Bound On Width [MinWidth Layerer]

Upper Layer Estimation Scaling Factor [MinWidth Layerer]

Upper limit for iterations of overlap removal

Valid Indices for Wrapping

Validate Graph

Validate Options

Validification Strategy

Vertical spacing between Label and Port

Weighting of Nodes

Whether to run a supplementary scanline overlap check.

White Space Approximation Strategy

Whitespace elimination strategy

Width Approximation Strategy

compaction.postCompaction

componentCompaction

considerModelOrder

crossingMinimization

crossingMinimization.greedySwitch

crossingMinimization.greedySwitchHierarchical

edgeRouting.splines.sloppy

layering.coffmanGraham

layering.minWidth

layering.nodePromotion

nodePlacement.linearSegments

nodePlacement.networkSimplex

nodePlacement.networkSimplex.nodeFlexibility

whiteSpaceElimination

whitespaceElimination