8096.index.js · part 5

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

File contents and all parts · All files

Node promotion heuristic

Anonymous function

Label and node size calculator can only be used with ports that have port sides assigned.

Invalid port label placement: 

Invalid node label placement: 

ELK Radial

A radial layout provider which is based on the algorithm of Peter Eades published in "Drawing free trees.", published by International Institute for Advanced Study of Social Information Science, Fujitsu Limited in 1991. The radial layouter takes a tree and places the nodes in radial order around the root. The nodes of the same tree level are placed on the same radius.

ELK Force

Force-based algorithm provided by the Eclipse Layout Kernel. Implements methods that follow physical analogies by simulating forces that move the nodes into a balanced distribution. Currently the original Eades model and the Fruchterman - Reingold model are supported.

ELK Mr. Tree

Tree-based algorithm provided by the Eclipse Layout Kernel. Computes a spanning tree of the input graph and arranges all nodes according to the resulting parent-children hierarchy. I pity the fool who doesn't use Mr. Tree Layout.

MinWidth layering

Network simplex node placement

Straight Edges Pre-Processing

Flexible Where Space Processing

Straight Edges Post-Processing

An edge must have a source node (edge id: '

The source port of an edge must be a port of the edge's source node (edge id: '

An edge must have a target node (edge id: '

The target port of an edge must be a port of the edge's target node (edge id: '

' is not a valid enumerator of '

' does not match any member types of the union datatype '

' is not a date formatted string of the form yyyy-MM-dd'T'HH:mm:ss'.'SSSZ or a valid subset thereof

' is invalid. 

The target node of the edge must be a normal node or a northSouthPort.

ELK Rectangle Packing

Algorithm for packing of unconnected boxes, i.e. graphs without edges. The given order of the boxes is always preserved and the main reading direction of the boxes is left to right. The algorithm is divided into two phases. One phase approximates the width in which the rectangles can be placed. The next phase places the rectangles in rows using the previously calculated width as bounding width and bundles rectangles with a similar height in blocks. A compaction step reduces the size of the drawing. Finally, the rectangles are expanded to fill their bounding box and eliminate empty unused spaces.

Process compaction

Coffman-Graham Layering

Brandes & Koepf node placement

 size is 

Chosen node placement: 

There are no classes in a balanced layout.

Marked edges: 

Unknown feature style: 

1st quarter

2nd quarter

3rd quarter

4th quarter

The source or the target of edge 

 could not be found. This usually happens when an edge connects a node laid out by ELK Layered to a node in another level of hierarchy laid out by either another instance of ELK Layered or another layout algorithm alltogether. The former can be solved by setting the hierarchyHandling option to INCLUDE_CHILDREN.

Basic Latin

Latin-1 Supplement

Latin Extended-A

Latin Extended-B

IPA Extensions

Spacing Modifier Letters

Combining Diacritical Marks

Hangul Jamo

Unified Canadian Aboriginal Syllabics

Latin Extended Additional

Greek Extended

General Punctuation

Superscripts and Subscripts

Currency Symbols

Combining Marks for Symbols

Letterlike Symbols

Number Forms

Mathematical Operators

Miscellaneous Technical