|Meta Data Provider:
Layered drawings of directed graphs. The algorithm aims edges in the same direction (top to bottom, or left to right) and then attempts to avoid edge crossings and reduce edge length. Edges are routed as spline curves and are thus drawn very smoothly. This algorithm is very suitable for state machine and activity diagrams, where the direction of edges has an important role.
The layer-based method was introduced by Sugiyama, Tagawa and Toda in 1981. It emphasizes the direction of edges by pointing as many edges as possible into the same direction. The nodes are arranged in layers, which are sometimes called “hierarchies”, and then reordered such that the number of edge crossings is minimized. Afterwards, concrete coordinates are computed for the nodes and edge bend points.
|Edges connecting a node with itself.
|Multiple edges with the same source and target node.
|Labels that are associated with edges.
|Edges that connect nodes from different hierarchy levelsand are incident to compound nodes.
|Edges that connect nodes from different clusters, but not the cluster parent nodes.
|Adapt Port Positions
|Edge Label Spacing
|Layer Spacing Factor
|Node Size Constraints
|Node Size Options