Class | Description | |
---|---|---|
![]() |
Implements a simulated annealing graph layout algorithm. |
|
![]() |
Performs cascading layout on simple, connected graphs. |
|
![]() |
Implements a circular graph layout algorithm. Nodes are distributed evenly on the circumference of a circle at positions that result in as few link crossing as possible. |
|
![]() |
Implements a multi-level graph layout algorithm. |
|
![]() |
Implements a flowchart layout algorithm. |
|
![]() |
FlowchartLayout can be used to arrange flowcharts representing program source code. |
|
![]() |
A tree layout algorithm that places child nodes symmetrically around their parent node. |
|
![]() |
Implements a grid graph layout algorithm. |
|
![]() |
Performs hierarchical layout on simple, connected, level-planar graphs. |
|
![]() |
Represents an ISwimlaneGrid which operates on a MindFusion.Diagramming.Lanes.Grid object. |
|
![]() |
Implements a layered graph layout algorithm. |
|
![]() |
Encapsulates information about a layered layout which has already complete. |
|
![]() |
The base class for all layout classes. |
|
![]() |
Implements a one-way graph layout algorithm. |
|
![]() |
Implements an orthogonal graph layout algorithm. Each link is drawn as a chain of alternating horizontal and vertical segments. Nodes are placed in a way that facilitates few links bends and crossings. |
|
![]() |
Implements an orthogonal link routing algorithm. |
|
![]() |
Represents a sequence of connected DiagramNode and DiagramLink elements. |
|
![]() |
Provides methods that help you find paths and cycles in a graph. |
|
![]() |
A tree layout algorithm that places child nodes around their parent node, such that the child nodes do not overlap. The algorithm optionally bends the links to prevent them from crossing nodes. |
|
![]() |
Implements the Spring-Embedder graph layout algorithm. |
|
![]() |
Implements an algorithm which arranges nodes in lanes. |
|
![]() |
Implements a topological ordering. |
|
![]() |
Implements several algorithms for arranging tree structures. |
|
![]() |
Implements a tree map layout algorithm. |
|
![]() |
Performs triangular layout on simple, connected graphs. |
Interface | Description | |
---|---|---|
![]() |
Common interface for all layout classes. |
|
![]() |
Represents an object which can be used by a SwimlaneLayout to adjust the corresponding swimlane grid. |
Delegate | Description | |
---|---|---|
![]() |
Represents methods that are called by the layout algorithms when the position of a link changes. |
|
![]() |
Represents methods that are called by the layout algorithms when the position of a node changes. |
|
![]() |
Represents methods that are called to report on progress of layout algorithms. |
|
![]() |
Represents methods that are called by the layout algorithms in order to perform custom arrangement of a subgraph. |
Enumeration | Description | |
---|---|---|
![]() |
Specifies a layout direction. |
|
![]() |
Specifies the style of the links after they are laid out. |
|
![]() |
Specifies graph orientation. |
|
![]() |
Specifies axial orientation. |
|
![]() |
Specifies the style of the diagram links after they are laid out. |
|
![]() |
Specifies how to order child nodes in order to produce tree layouts with custom balance. |
|
![]() |
Specifies the direction of a tree layout. |
|
![]() |
Specifies the shape of the diagram links after they are laid out. |
|
![]() |
Specifies the type of a tree layout. |