| Package | Description |
|---|---|
| com.yworks.yfiles.graph |
Definitions, default implementations, and support classes that represent graph structures and provide facilities for their programmatic modification.
|
| com.yworks.yfiles.layout |
Provides essential classes and interfaces that constitute the infrastructure for automatic graph layout generation.
|
| com.yworks.yfiles.layout.circular |
Provides circular layout style algorithms.
|
| com.yworks.yfiles.layout.genealogy |
Provides layout algorithms that are especially suited for genealogical family trees.
|
| com.yworks.yfiles.layout.hierarchic |
Provides hierarchic layout style algorithms.
|
| com.yworks.yfiles.layout.labeling |
Provides algorithms for the automatic placement of node and edge labels, so called generic labeling algorithms.
|
| com.yworks.yfiles.layout.multipage |
Provides the
MultiPageLayout that subdivides the input graph into several smaller graphs whose layouts fit the specified maximum page size. |
| com.yworks.yfiles.layout.organic |
Provides organic layout style algorithms that are based on a force-directed layout paradigm.
|
| com.yworks.yfiles.layout.orthogonal |
Provides orthogonal layout style algorithms.
|
| com.yworks.yfiles.layout.partial |
Provides class
PartialLayout that enables layout of user-specified, distinct parts of a diagram without altering the existing layout of the remainder of the diagram. |
| com.yworks.yfiles.layout.radial |
Provides the radial layout algorithm.
|
| com.yworks.yfiles.layout.router |
Provides classes for automatic routing of the edges in a graph.
|
| com.yworks.yfiles.layout.router.polyline |
Provides classes and interfaces for automatic polyline routing of the edges of a graph.
|
| com.yworks.yfiles.layout.seriesparallel |
Provides the series-parallel layout algorithm.
|
| com.yworks.yfiles.layout.tree |
Provides tree layout style algorithms.
|
| com.yworks.yfiles.view |
Contains the main UI classes, interfaces, default implementations and support classes that can be used to display
IGraph instances. |
| Class and Description |
|---|
| CopiedLayoutGraph
A
CopiedLayoutGraph is a LayoutGraph that serves as a copy of another graph with layout
information. |
ILayoutAlgorithm
ILayoutAlgorithm describes the general interface for algorithms that perform a layout process on a
LayoutGraph. |
| LayoutData
Base for convenience classes that specify custom data for a layout calculation done with the
LayoutExecutor. |
| LayoutEventArgs
This event argument is used by
LayoutFinished
event. |
| Class and Description |
|---|
| AbstractLayoutStage
Abstract base class implementing
ILayoutStage that handles the management of the
core layout algorithm. |
| ColumnDescriptor
This class represents a column of a
partition grid structure. |
| ComponentArrangementStyles |
| ComponentLayout
A
ComponentLayout arranges the connected components of a graph. |
| ContextItemMapping
Provides different ways to define a mapping from items to values that takes a context object into consideration, too.
|
| CopiedLayoutGraph
A
CopiedLayoutGraph is a LayoutGraph that serves as a copy of another graph with layout
information. |
| DataProviderAdapter
Wraps an
IMapper into an IDataProvider. |
Direction
Direction provides four main directions and some methods to work with them. |
| DiscreteEdgeLabelPositions |
| DiscreteNodeLabelPositions |
| EdgeBundleDescriptor
An
EdgeBundleDescriptor defines the bundling settings of an edge. |
| EdgeFlow |
| EdgeLabelCandidate
An
EdgeLabelCandidate describes one valid placement for an edge label considering the label model. |
| FixPointPolicy
Fix point calculation policy specifying that the center of a rectangle containing all fixed nodes is considered
the fix point.
|
IEdgeLabelLayout
IEdgeLabelLayout defines the properties of one edge label from the perspective of a labeling algorithm. |
| IEdgeLabelLayoutModel
This interface defines the properties of the model associated with an
IEdgeLabelLayout. |
| IEdgeLayout
An
IEdgeLayout encapsulates the layout information for an edge. |
| IGroupBoundsCalculator
A
IGroupBoundsCalculator is responsible for calculating the bounds of a group node during a layout process. |
| IIntersectionCalculator
An
IIntersectionCalculator is responsible for calculating the intersection point between an edge and the visual
representation of its source or target node. |
ILabelLayout
ILabelLayout defines the properties of a label from the perspective of a labeling algorithm. |
ILabelLayoutFactory
ILabelLayoutFactory provides methods to create, add and remove node/edge labels for LayoutGraphs. |
ILayoutAlgorithm
ILayoutAlgorithm describes the general interface for algorithms that perform a layout process on a
LayoutGraph. |
| ILayoutStage
A
ILayoutStage is a layout algorithm that represents a stage of a larger layout process. |
INodeLabelLayout
INodeLabelLayout defines the properties of one node label from the perspective of a labeling algorithm. |
INodeLabelLayoutModel
INodeLabelLayoutModel defines the properties of the model associated with a INodeLabelLayout. |
| INodeLayout
A
INodeLayout encapsulates the layout information for a node. |
| InsetsGroupBoundsCalculator
This
IGroupBoundsCalculator calculates the bounds of group nodes and allows to specify custom insets for each
group node. |
| InterEdgeRoutingStyle |
| IProfitModel
A
IProfitModel ranks LabelCandidates used for prioritizing certain label locations over others. |
| ItemCollection
Provides different ways to define the items in a collection for use with
LayoutData. |
| ItemMapping
Provides different ways to define a mapping from items to values for use with
LayoutData. |
| LabelAngleOnRightSideOffsets
Angle offset specifier for edge labels which expresses that no additional offset should be added to the angle.
|
| LabelAngleOnRightSideRotations
Angle interpretation specifier which expresses that the rotation angle should be interpreted clockwise.
|
| LabelAngleReferences
Angle interpretation specifier for edge labels which expresses that the rotation angle should be interpreted relative to
the edge slope.
|
| LabelCandidate
A
LabelCandidate describes one valid placement for a label considering the label model. |
LabelLayoutData
LabelLayoutData encapsulates layout information for a label. |
| LabelPlacements |
| LabelSideReferences |
| LayoutData
Base for convenience classes that specify custom data for a layout calculation done with the
LayoutExecutor. |
| LayoutEventArgs
This event argument is used by
LayoutFinished
event. |
| LayoutGraph
A
LayoutGraph is a Graph with attached layout information that basically represents a drawing of a
graph. |
| LayoutGraphAdapter
Adapter class that can be used to obtain an
LayoutGraph from an IGraph. |
| LayoutOrientation
Orientation specifier which defines that the main layout orientation is from top to bottom.
|
| MirrorModes |
| MultiRowConstraint |
| MultiStageLayout
An abstract base class for layout algorithms that provides services to simplify and decompose the input graph before it
is passed to the
core layout algorithm itself. |
| NodeAlignment |
| NodeHalo
A
NodeHalo specifies a rectangular area around a specific node. |
| NodeLabelCandidate
A
NodeLabelCandidate describes one valid placement for a node label considering the label model. |
| OperationType |
OrientationLayout
OrientationLayout is a ILayoutStage that changes the orientation of the layout. |
PartitionCellId
PartitionCellId represents an identifier for partition cells of a partition grid
structure. |
| PartitionCellId.Cell
This class represents a single partition cell, i.e., a pair consisting of a row and a column.
|
| PartitionGrid
This class represents a partition grid that partitions the drawing area into rectangular partition cells.
|
| PartitionLayout.IInterEdgeRouter
An
PartitionLayout.IInterEdgeRouter is responsible for routing inter-edges. |
| PartitionLayout.IPartitionFinder
A
PartitionLayout.IPartitionFinder is responsible for partitioning the input graph. |
| PartitionLayout.IPartitionPlacer
A
PartitionLayout.IPartitionPlacer is responsible for arranging the graph partitions. |
| PortCandidate
This class represents a candidate port on which edges can be connected to their source and/or target node.
|
| PortCandidateSet
This class associates
PortCandidates with the nodes of a graph. |
| PortCandidateSet.ICandidateMatcher |
| PortCandidateSet.IEntry
This interface represents an entry of a
PortCandidateSet and provides access to the actual PortCandidate
instance and the maximum number of edges allowed to connect to it. |
| PortConstraint
A
PortConstraint represents a constraint for the source or target port of an edge path. |
| PortDirections |
| PortSide |
| PreferredPlacementDescriptor
A
PreferredPlacementDescriptor provides placement information for automatic edge labeling. |
| RowAlignment
Row alignment specifier which defines that each row will be aligned with its center.
|
| RowDescriptor
This class represents a row of a
partition grid structure. |
| SelfLoopStyle
Self-loop style specifier which defines that the routes of self-loops are rounded.
|
| SingleItemCollection
Provides different ways to define the items in a collection for use with
LayoutData, especially if the collection contains only one item. |
| SliderMode
Slider mode specifier which describes continuous label positions directly on the edge path.
|
| SwimlanesMode |
| TableLayoutConfigurator
Creates a
PartitionGrid that matches a given table configuration of an IGraph and registers IMapper
for that grid at the graph. |
| Class and Description |
|---|
| CopiedLayoutGraph
A
CopiedLayoutGraph is a LayoutGraph that serves as a copy of another graph with layout
information. |
| EdgeBundleDescriptor
An
EdgeBundleDescriptor defines the bundling settings of an edge. |
| EdgeBundling
An
EdgeBundling instance defines if and how the edges of a graph should be bundled by a
layout algorithm, given that the algorithm supports edge bundling. |
ILayoutAlgorithm
ILayoutAlgorithm describes the general interface for algorithms that perform a layout process on a
LayoutGraph. |
| ItemMapping
Provides different ways to define a mapping from items to values for use with
LayoutData. |
| LayoutData
Base for convenience classes that specify custom data for a layout calculation done with the
LayoutExecutor. |
| LayoutGraph
A
LayoutGraph is a Graph with attached layout information that basically represents a drawing of a
graph. |
| LayoutGraphAdapter
Adapter class that can be used to obtain an
LayoutGraph from an IGraph. |
| MultiStageLayout
An abstract base class for layout algorithms that provides services to simplify and decompose the input graph before it
is passed to the
core layout algorithm itself. |
| NodeHalo
A
NodeHalo specifies a rectangular area around a specific node. |
| Class and Description |
|---|
| CopiedLayoutGraph
A
CopiedLayoutGraph is a LayoutGraph that serves as a copy of another graph with layout
information. |
ILayoutAlgorithm
ILayoutAlgorithm describes the general interface for algorithms that perform a layout process on a
LayoutGraph. |
| ItemMapping
Provides different ways to define a mapping from items to values for use with
LayoutData. |
| LayoutData
Base for convenience classes that specify custom data for a layout calculation done with the
LayoutExecutor. |
| LayoutGraph
A
LayoutGraph is a Graph with attached layout information that basically represents a drawing of a
graph. |
| LayoutGraphAdapter
Adapter class that can be used to obtain an
LayoutGraph from an IGraph. |
| MultiStageLayout
An abstract base class for layout algorithms that provides services to simplify and decompose the input graph before it
is passed to the
core layout algorithm itself. |
| Class and Description |
|---|
| AbstractLayoutStage
Abstract base class implementing
ILayoutStage that handles the management of the
core layout algorithm. |
| ContextItemMapping
Provides different ways to define a mapping from items to values that takes a context object into consideration, too.
|
| CopiedLayoutGraph
A
CopiedLayoutGraph is a LayoutGraph that serves as a copy of another graph with layout
information. |
| GroupingSupport
This class provides convenient and efficient access to the hierarchic graph structure.
|
ILayoutAlgorithm
ILayoutAlgorithm describes the general interface for algorithms that perform a layout process on a
LayoutGraph. |
| ILayoutStage
A
ILayoutStage is a layout algorithm that represents a stage of a larger layout process. |
| INodeLayout
A
INodeLayout encapsulates the layout information for a node. |
| ItemCollection
Provides different ways to define the items in a collection for use with
LayoutData. |
| ItemMapping
Provides different ways to define a mapping from items to values for use with
LayoutData. |
| LayoutData
Base for convenience classes that specify custom data for a layout calculation done with the
LayoutExecutor. |
| LayoutGraph
A
LayoutGraph is a Graph with attached layout information that basically represents a drawing of a
graph. |
| LayoutGraphAdapter
Adapter class that can be used to obtain an
LayoutGraph from an IGraph. |
| LayoutOrientation
Orientation specifier which defines that the main layout orientation is from top to bottom.
|
| MirrorModes |
| MultiStageLayout
An abstract base class for layout algorithms that provides services to simplify and decompose the input graph before it
is passed to the
core layout algorithm itself. |
| NodeHalo
A
NodeHalo specifies a rectangular area around a specific node. |
| PartitionGridData
Specifies a
PartitionGrid for a layout. |
| PortCandidate
This class represents a candidate port on which edges can be connected to their source and/or target node.
|
| PortCandidateSet
This class associates
PortCandidates with the nodes of a graph. |
| PortConstraint
A
PortConstraint represents a constraint for the source or target port of an edge path. |
| RowDescriptor
This class represents a row of a
partition grid structure. |
| Class and Description |
|---|
| AbstractLayoutStage
Abstract base class implementing
ILayoutStage that handles the management of the
core layout algorithm. |
| CopiedLayoutGraph
A
CopiedLayoutGraph is a LayoutGraph that serves as a copy of another graph with layout
information. |
| DpKeyItemCollection
An item collection that allows to specify the data provider key the collection is registered with.
|
| IEdgeLabelLayoutModel
This interface defines the properties of the model associated with an
IEdgeLabelLayout. |
ILayoutAlgorithm
ILayoutAlgorithm describes the general interface for algorithms that perform a layout process on a
LayoutGraph. |
| ILayoutStage
A
ILayoutStage is a layout algorithm that represents a stage of a larger layout process. |
INodeLabelLayoutModel
INodeLabelLayoutModel defines the properties of the model associated with a INodeLabelLayout. |
| IProfitModel
A
IProfitModel ranks LabelCandidates used for prioritizing certain label locations over others. |
| ItemMapping
Provides different ways to define a mapping from items to values for use with
LayoutData. |
| LabelCandidate
A
LabelCandidate describes one valid placement for a label considering the label model. |
| LayoutData
Base for convenience classes that specify custom data for a layout calculation done with the
LayoutExecutor. |
| LayoutGraph
A
LayoutGraph is a Graph with attached layout information that basically represents a drawing of a
graph. |
| LayoutGraphAdapter
Adapter class that can be used to obtain an
LayoutGraph from an IGraph. |
| NodeHalo
A
NodeHalo specifies a rectangular area around a specific node. |
| Class and Description |
|---|
| AbstractLayoutStage
Abstract base class implementing
ILayoutStage that handles the management of the
core layout algorithm. |
| CopiedLayoutGraph
A
CopiedLayoutGraph is a LayoutGraph that serves as a copy of another graph with layout
information. |
IEdgeLabelLayout
IEdgeLabelLayout defines the properties of one edge label from the perspective of a labeling algorithm. |
ILayoutAlgorithm
ILayoutAlgorithm describes the general interface for algorithms that perform a layout process on a
LayoutGraph. |
| ILayoutStage
A
ILayoutStage is a layout algorithm that represents a stage of a larger layout process. |
INodeLabelLayout
INodeLabelLayout defines the properties of one node label from the perspective of a labeling algorithm. |
| ItemMapping
Provides different ways to define a mapping from items to values for use with
LayoutData. |
| LayoutData
Base for convenience classes that specify custom data for a layout calculation done with the
LayoutExecutor. |
| LayoutGraph
A
LayoutGraph is a Graph with attached layout information that basically represents a drawing of a
graph. |
| LayoutGraphAdapter
Adapter class that can be used to obtain an
LayoutGraph from an IGraph. |
| Class and Description |
|---|
| AbstractLayoutStage
Abstract base class implementing
ILayoutStage that handles the management of the
core layout algorithm. |
| ComponentLayout
A
ComponentLayout arranges the connected components of a graph. |
| CopiedLayoutGraph
A
CopiedLayoutGraph is a LayoutGraph that serves as a copy of another graph with layout
information. |
| IGroupBoundsCalculator
A
IGroupBoundsCalculator is responsible for calculating the bounds of a group node during a layout process. |
ILayoutAlgorithm
ILayoutAlgorithm describes the general interface for algorithms that perform a layout process on a
LayoutGraph. |
| ILayoutStage
A
ILayoutStage is a layout algorithm that represents a stage of a larger layout process. |
| ItemCollection
Provides different ways to define the items in a collection for use with
LayoutData. |
| ItemMapping
Provides different ways to define a mapping from items to values for use with
LayoutData. |
| LayoutData
Base for convenience classes that specify custom data for a layout calculation done with the
LayoutExecutor. |
| LayoutGraph
A
LayoutGraph is a Graph with attached layout information that basically represents a drawing of a
graph. |
| LayoutGraphAdapter
Adapter class that can be used to obtain an
LayoutGraph from an IGraph. |
| MultiStageLayout
An abstract base class for layout algorithms that provides services to simplify and decompose the input graph before it
is passed to the
core layout algorithm itself. |
| NodeHalo
A
NodeHalo specifies a rectangular area around a specific node. |
| PartitionGridData
Specifies a
PartitionGrid for a layout. |
| Class and Description |
|---|
| AbstractLayoutStage
Abstract base class implementing
ILayoutStage that handles the management of the
core layout algorithm. |
| CopiedLayoutGraph
A
CopiedLayoutGraph is a LayoutGraph that serves as a copy of another graph with layout
information. |
ILayoutAlgorithm
ILayoutAlgorithm describes the general interface for algorithms that perform a layout process on a
LayoutGraph. |
| ILayoutStage
A
ILayoutStage is a layout algorithm that represents a stage of a larger layout process. |
| ItemCollection
Provides different ways to define the items in a collection for use with
LayoutData. |
| ItemMapping
Provides different ways to define a mapping from items to values for use with
LayoutData. |
| LayoutData
Base for convenience classes that specify custom data for a layout calculation done with the
LayoutExecutor. |
| LayoutGraph
A
LayoutGraph is a Graph with attached layout information that basically represents a drawing of a
graph. |
| LayoutGraphAdapter
Adapter class that can be used to obtain an
LayoutGraph from an IGraph. |
| MultiStageLayout
An abstract base class for layout algorithms that provides services to simplify and decompose the input graph before it
is passed to the
core layout algorithm itself. |
| NodeHalo
A
NodeHalo specifies a rectangular area around a specific node. |
PartitionLayout
PartitionLayout provides a framework for layouts that are based on a divide and conquer approach. |
| Class and Description |
|---|
| AbstractLayoutStage
Abstract base class implementing
ILayoutStage that handles the management of the
core layout algorithm. |
| CopiedLayoutGraph
A
CopiedLayoutGraph is a LayoutGraph that serves as a copy of another graph with layout
information. |
ILayoutAlgorithm
ILayoutAlgorithm describes the general interface for algorithms that perform a layout process on a
LayoutGraph. |
| ILayoutStage
A
ILayoutStage is a layout algorithm that represents a stage of a larger layout process. |
| ItemCollection
Provides different ways to define the items in a collection for use with
LayoutData. |
| ItemMapping
Provides different ways to define a mapping from items to values for use with
LayoutData. |
| LayoutData
Base for convenience classes that specify custom data for a layout calculation done with the
LayoutExecutor. |
| LayoutGraph
A
LayoutGraph is a Graph with attached layout information that basically represents a drawing of a
graph. |
| LayoutGraphAdapter
Adapter class that can be used to obtain an
LayoutGraph from an IGraph. |
| NodeHalo
A
NodeHalo specifies a rectangular area around a specific node. |
| PartitionGridData
Specifies a
PartitionGrid for a layout. |
| PortCandidate
This class represents a candidate port on which edges can be connected to their source and/or target node.
|
| PortConstraint
A
PortConstraint represents a constraint for the source or target port of an edge path. |
| Class and Description |
|---|
| CopiedLayoutGraph
A
CopiedLayoutGraph is a LayoutGraph that serves as a copy of another graph with layout
information. |
| DpKeyItemCollection
An item collection that allows to specify the data provider key the collection is registered with.
|
| EdgeBundleDescriptor
An
EdgeBundleDescriptor defines the bundling settings of an edge. |
| EdgeBundling
An
EdgeBundling instance defines if and how the edges of a graph should be bundled by a
layout algorithm, given that the algorithm supports edge bundling. |
ILayoutAlgorithm
ILayoutAlgorithm describes the general interface for algorithms that perform a layout process on a
LayoutGraph. |
| ItemMapping
Provides different ways to define a mapping from items to values for use with
LayoutData. |
| LayoutData
Base for convenience classes that specify custom data for a layout calculation done with the
LayoutExecutor. |
| LayoutGraph
A
LayoutGraph is a Graph with attached layout information that basically represents a drawing of a
graph. |
| LayoutGraphAdapter
Adapter class that can be used to obtain an
LayoutGraph from an IGraph. |
| MultiStageLayout
An abstract base class for layout algorithms that provides services to simplify and decompose the input graph before it
is passed to the
core layout algorithm itself. |
| NodeHalo
A
NodeHalo specifies a rectangular area around a specific node. |
| Class and Description |
|---|
| AbstractLayoutStage
Abstract base class implementing
ILayoutStage that handles the management of the
core layout algorithm. |
| CopiedLayoutGraph
A
CopiedLayoutGraph is a LayoutGraph that serves as a copy of another graph with layout
information. |
| DpKeyItemCollection
An item collection that allows to specify the data provider key the collection is registered with.
|
ILayoutAlgorithm
ILayoutAlgorithm describes the general interface for algorithms that perform a layout process on a
LayoutGraph. |
| ILayoutStage
A
ILayoutStage is a layout algorithm that represents a stage of a larger layout process. |
| ItemCollection
Provides different ways to define the items in a collection for use with
LayoutData. |
| ItemMapping
Provides different ways to define a mapping from items to values for use with
LayoutData. |
| LayoutData
Base for convenience classes that specify custom data for a layout calculation done with the
LayoutExecutor. |
| LayoutGraph
A
LayoutGraph is a Graph with attached layout information that basically represents a drawing of a
graph. |
| LayoutGraphAdapter
Adapter class that can be used to obtain an
LayoutGraph from an IGraph. |
| PortCandidate
This class represents a candidate port on which edges can be connected to their source and/or target node.
|
| PortCandidateSet
This class associates
PortCandidates with the nodes of a graph. |
| PortConstraint
A
PortConstraint represents a constraint for the source or target port of an edge path. |
| Class and Description |
|---|
| AbstractLayoutStage
Abstract base class implementing
ILayoutStage that handles the management of the
core layout algorithm. |
| CopiedLayoutGraph
A
CopiedLayoutGraph is a LayoutGraph that serves as a copy of another graph with layout
information. |
Direction
Direction provides four main directions and some methods to work with them. |
| DpKeyItemCollection
An item collection that allows to specify the data provider key the collection is registered with.
|
| GroupingSupport
This class provides convenient and efficient access to the hierarchic graph structure.
|
ILayoutAlgorithm
ILayoutAlgorithm describes the general interface for algorithms that perform a layout process on a
LayoutGraph. |
| ILayoutStage
A
ILayoutStage is a layout algorithm that represents a stage of a larger layout process. |
| ItemCollection
Provides different ways to define the items in a collection for use with
LayoutData. |
| ItemMapping
Provides different ways to define a mapping from items to values for use with
LayoutData. |
| LayoutData
Base for convenience classes that specify custom data for a layout calculation done with the
LayoutExecutor. |
| LayoutGraph
A
LayoutGraph is a Graph with attached layout information that basically represents a drawing of a
graph. |
| LayoutGraphAdapter
Adapter class that can be used to obtain an
LayoutGraph from an IGraph. |
| NodeHalo
A
NodeHalo specifies a rectangular area around a specific node. |
| PartitionGridData
Specifies a
PartitionGrid for a layout. |
| PortCandidate
This class represents a candidate port on which edges can be connected to their source and/or target node.
|
| PortCandidateSet
This class associates
PortCandidates with the nodes of a graph. |
| PortConstraint
A
PortConstraint represents a constraint for the source or target port of an edge path. |
| Class and Description |
|---|
| CopiedLayoutGraph
A
CopiedLayoutGraph is a LayoutGraph that serves as a copy of another graph with layout
information. |
ILayoutAlgorithm
ILayoutAlgorithm describes the general interface for algorithms that perform a layout process on a
LayoutGraph. |
| ItemMapping
Provides different ways to define a mapping from items to values for use with
LayoutData. |
| LayoutData
Base for convenience classes that specify custom data for a layout calculation done with the
LayoutExecutor. |
| LayoutGraph
A
LayoutGraph is a Graph with attached layout information that basically represents a drawing of a
graph. |
| LayoutGraphAdapter
Adapter class that can be used to obtain an
LayoutGraph from an IGraph. |
| MultiStageLayout
An abstract base class for layout algorithms that provides services to simplify and decompose the input graph before it
is passed to the
core layout algorithm itself. |
| Class and Description |
|---|
| AbstractLayoutStage
Abstract base class implementing
ILayoutStage that handles the management of the
core layout algorithm. |
| CopiedLayoutGraph
A
CopiedLayoutGraph is a LayoutGraph that serves as a copy of another graph with layout
information. |
| EdgeBundleDescriptor
An
EdgeBundleDescriptor defines the bundling settings of an edge. |
| EdgeBundling
An
EdgeBundling instance defines if and how the edges of a graph should be bundled by a
layout algorithm, given that the algorithm supports edge bundling. |
| IEdgeLayout
An
IEdgeLayout encapsulates the layout information for an edge. |
ILayoutAlgorithm
ILayoutAlgorithm describes the general interface for algorithms that perform a layout process on a
LayoutGraph. |
| ILayoutStage
A
ILayoutStage is a layout algorithm that represents a stage of a larger layout process. |
| INodeLayout
A
INodeLayout encapsulates the layout information for a node. |
| ItemCollection
Provides different ways to define the items in a collection for use with
LayoutData. |
| ItemMapping
Provides different ways to define a mapping from items to values for use with
LayoutData. |
| LayoutData
Base for convenience classes that specify custom data for a layout calculation done with the
LayoutExecutor. |
| LayoutGraph
A
LayoutGraph is a Graph with attached layout information that basically represents a drawing of a
graph. |
| LayoutGraphAdapter
Adapter class that can be used to obtain an
LayoutGraph from an IGraph. |
| MultiStageLayout
An abstract base class for layout algorithms that provides services to simplify and decompose the input graph before it
is passed to the
core layout algorithm itself. |
| NodeHalo
A
NodeHalo specifies a rectangular area around a specific node. |
| PortConstraint
A
PortConstraint represents a constraint for the source or target port of an edge path. |
| Class and Description |
|---|
ILayoutAlgorithm
ILayoutAlgorithm describes the general interface for algorithms that perform a layout process on a
LayoutGraph. |
| LayoutData
Base for convenience classes that specify custom data for a layout calculation done with the
LayoutExecutor. |
| LayoutEventArgs
This event argument is used by
LayoutFinished
event. |