See: Description
Class | Description |
---|---|
CompactOrthogonalLayout |
This layout algorithm arranges a graph in a compact, orthogonal fashion.
|
EdgeLayoutDescriptor |
This class provides layout information for the edges of the graph.
|
KanCompactor |
Performs compaction for quasi-orthogonal shapes in the Kandinsky-Model.
|
KandinskyConstants |
This class defines constants used in the kandinsky layouter.
|
OrthogonalLayout |
This layout algorithm arranges graphs in an orthogonal fashion.
|
OrthogonalLayoutData |
Specifies custom data for the
OrthogonalLayout . |
Enum | Description |
---|---|
LayoutStyle |
Provides orthogonal layout style algorithms.
In an orthogonal layout, each edge is drawn as an alternating sequence of horizontal and vertical line segments. Algorithm implementations support layout of graphs that are "flat" as well as hierarchically grouped graphs, i.e., graphs where nodes can be nested within other nodes to arbitrary depth.
The main algorithm class is OrthogonalLayout
.
In addition to general orthogonal layouts, it provides support for an edge routing that satisfies edge path-related constraints. This highlights a main layout direction by preferring edge routes in that direction.
Default orthogonal layout
Orthogonal layout of a hierarchically grouped graph
Directed orthogonal layout with grouped edges. Marked edges are those that are considered directed.