8096.index.js · part 14

60 text occurrences from agent-cli/package/8096.index.js, part 14. Every entry preserves the shipped literal and its saved verdict or selection reason.

File contents and all parts · All files

Calculate Graph Size

Center On Root

Centers the layout on the root of the tree i.e. so that the central node is also the center node of the final layout. This introduces additional whitespace.

Order ID

The id can be used to define an order for nodes of one radius. This can be used to sort them in the layer accordingly.

The radius option can be used to set the initial radius for the radial layouter.

The rotate option determines whether a rotation of the layout should be performed.

With the compacter option it can be determined how compaction on the graph is done. It can be chosen between none, the radial compaction or the compaction of wedges separately.

Compaction Step Size

Determine the size of steps with which the compaction is done. Step size 1 correlates to a compaction of 1 pixel per Iteration.

Sort the nodes per radius according to the sorting algorithm. The strategies are none, by the given order id, or sorting them by polar coordinates.

Annulus Wedge Criteria

Determine how the wedge for the node placement is calculated. It can be chosen between wedge determination by the number of leaves or by the maximum sum of diagonals.

Translation Optimization

Find the optimal translation of the nodes of the first radii according to this criteria. For example edge crossings can be minimized.

Target Angle

The angle in radians that the layout should be rotated to after layout.

Additional Wedge Space

If set to true, modifies the target angle by rotating further such that space is left for an edge to pass in between the nodes. This option should only be used in conjunction with top-down layout.

Outgoing Edge Angles

Calculate the required angle of connected nodes to leave space for an incoming edge. This option should only be used in conjunction with top-down layout.

Rectangle Packing

Interactive Node Reorderer

Min Size Postprocessing

Min Size Preprocessing

Try box layout first

Whether one should check whether the regions are stackable to see whether box layout would do the job. For example, nodes with the same height are not stackable inside a row. Therefore, box layout will perform better and faster.

Current position of a node in the order of nodes

The rectangles are ordered. Normally according to their definition the the model. This option specifies the current position of a node.

Desired index of node

The rectangles are ordered. Normally according to their definition the the model. This option allows to specify a desired position that has preference over the original position.

In new Row

If set to true this node begins in a new row. Consequently this node cannot be moved in a previous layer during compaction. Width approximation does does not take this into account.

Order nodes by height

If set to true the nodes will be sorted by their height before computing the layout. The largest node will be in the first position.

Width Approximation Strategy

Strategy for finding an initial width of the drawing.

Target Width

Option to place the rectangles in the given target width instead of approximating the width using the desired aspect ratio. The padding is not included in this. Meaning a drawing will have width of targetwidth + horizontal padding.

Optimization Goal

Optimization goal for approximation of the bounding box given by the first iteration. Determines whether layout is sorted by the maximum scaling, aspect ratio, or area. Depending on the strategy the aspect ratio might be nearly ignored.

Shift Last Placed.

When placing a rectangle behind or below the last placed rectangle in the first iteration, it is sometimes possible to shift the rectangle further to the left or right, resulting in less whitespace. True (default) enables the shift and false disables it. Disabling the shift produces a greater approximated area by the first iteration and a layout, when using ONLY the first iteration (default not the case), where it is sometimes impossible to implement a size transformation of rectangles that will fill the bounding box and eliminate empty spaces.

Strategy for finding an initial placement on nodes.

Row Height Reevaluation

During the compaction step the height of a row is normally not changed. If this options is set, the blocks of other rows might be added if they exceed the row height. If this is the case the whole row has to be packed again to be optimal regarding the new row height. This option should, therefore, be used with care since it might be computation heavy.

Compaction iterations

Defines the number of compaction iterations. E.g. if set to 2 the width is initially approximated, then the drawing is compacted and based on the resulting drawing the target width is decreased or increased and a second compaction step is executed and the result compared to the first one. The best run is used based on the scale measure.

White Space Approximation Strategy

Strategy for expanding nodes such that whitespace in the parent is eliminated.

Target Width Setter

A target width has to be set if the TargetWidthWidthApproximator should be used.

To Aspect Ratio Whitesapce Eliminator

Overlap removal

Compaction by shrinking a tree

Underlying Layout Algorithm

A layout algorithm that is applied to the graph before it is compacted. If this is null, nothing is applied before compaction.

Structure Extraction Strategy

This option defines what kind of triangulation or other partitioning of the plane is applied to the vertices.

Tree Construction Strategy