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. |
Modifier and Type | Method and Description |
---|---|
static void |
LayoutUtilities.applyLayout(IGraph graph,
ILayoutAlgorithm layout)
Convenience method that runs a layout on a graph using
LayoutGraphAdapter.applyLayout(IGraph, ILayoutAlgorithm, LayoutData) . |
static void |
LayoutUtilities.applyLayout(IGraph graph,
ILayoutAlgorithm layout,
LayoutData layoutData)
Convenience method that runs a layout on a graph using
LayoutGraphAdapter.applyLayout(IGraph, ILayoutAlgorithm, LayoutData) . |
default void |
IGraph.applyLayout(ILayoutAlgorithm layout)
Convenience method that runs a layout on a graph using
LayoutGraphAdapter.applyLayout(IGraph, ILayoutAlgorithm, LayoutData) . |
default void |
IGraph.applyLayout(ILayoutAlgorithm layout,
LayoutData layoutData)
Convenience method that runs a layout on a graph using
LayoutGraphAdapter.applyLayout(IGraph, ILayoutAlgorithm, LayoutData) . |
static void |
LayoutUtilities.morphLayout(GraphControl graphControl,
ILayoutAlgorithm layout,
Duration morphDuration)
Convenience method that runs a layout on the graph of a given graph control, animates the transition, and calls the
given
doneHandler once the animation has finished. |
static void |
LayoutUtilities.morphLayout(GraphControl graphControl,
ILayoutAlgorithm layout,
Duration morphDuration,
IEventHandler<LayoutEventArgs> doneHandler)
Convenience method that runs a layout on the graph of a given graph control, animates the transition, and calls the
given
doneHandler once the animation has finished. |
static void |
LayoutUtilities.morphLayout(GraphControl control,
ILayoutAlgorithm layout,
Duration morphDuration,
LayoutData layoutData)
Convenience method that runs a layout on the graph of a given graph control, animates the transition, and calls the
given
doneHandler once the animation has finished. |
static void |
LayoutUtilities.morphLayout(GraphControl control,
ILayoutAlgorithm layout,
Duration morphDuration,
LayoutData layoutData,
IEventHandler<LayoutEventArgs> doneHandler)
Convenience method that runs a layout on the graph of a given graph control, animates the transition, and calls the
given
doneHandler once the animation has finished. |
Modifier and Type | Interface and Description |
---|---|
interface |
ILayoutStage
A
ILayoutStage is a layout algorithm that represents a stage of a larger layout process. |
Modifier and Type | Class and Description |
---|---|
class |
AbstractLayoutStage
Abstract base class implementing
ILayoutStage that handles the management of the
core layout algorithm . |
class |
BendConverter
BendConverter replaces edge bends with dummy nodes for the core layout algorithm . |
class |
BufferedLayout
A
BufferedLayout is a hull algorithm that invokes its core layout algorithm
on a copy of the input graph. |
class |
ComponentLayout
A
ComponentLayout arranges the connected components of a graph. |
class |
CompositeLayoutStage
CompositeLayoutStage allows for combining multiple ILayoutStage s. |
class |
CurveFittingLayoutStage
CurveFittingLayoutStage fits a piecewise cubic bezier curve to given arbitrary edge paths. |
class |
FixGroupLayoutStage
A
layout stage that can handle fixed nodes in hierarchically grouped graphs. |
class |
FixNodeLayoutStage
FixNodeLayoutStage fixes the initial position of either a single node or the alignment of the bounding
box of several nodes (but not the positions of the individual nodes). |
class |
FixPortLocationStage
FixPortLocationStage ensures that layout algorithms that cannot handle port constraints keep the ports of edges
with strong PortConstraint s. |
class |
GraphLayoutLineWrapper
GraphLayoutLineWrapper can line-wrap or column-wrap a graph layout. |
class |
GraphTransformer
This layout algorithm applies geometric transformations to (sub-)graphs.
|
class |
HandleNaNCoordinatesStage
A
ILayoutStage that temporarily removes all nodes and edges with NaN -coordinates. |
class |
HideGroupsStage
A
layout stage that hides the group nodes of hierarchically grouped graphs. |
class |
IsolatedGroupComponentLayout
A special
ComponentLayout implementation that allows to lay out isolated subgraphs within a group as separate
components. |
class |
LabelLayoutTranslator
LabelLayoutTranslator automatically translates label layout information provided by the standard label layout
classes IEdgeLabelLayout and INodeLabelLayout to layout data of type LabelLayoutData that is
accessible by the keys defined in class LabelLayoutKeys . |
class |
LayoutMultiplexer
A
LayoutMultiplexer delegates its layout calls to a core layout algorithm that is dynamically chosen at runtime
by inspecting the nodes of the input graph. |
class |
MinimumNodeSizeStage
MinimumNodeSizeStage enforces a given minimum width/height of the nodes of a graph during the layout process. |
class |
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 |
NormalizeGraphElementOrderStage
NormalizeGraphElementOrderStage normalizes the order of the elements within a graph to ensure the same order for
multiple layout invocations. |
class |
OrientationLayout
OrientationLayout is a ILayoutStage that changes the orientation of the layout. |
class |
ParallelEdgeRouter
ParallelEdgeRouter is a ILayoutStage that routes parallel edges which connect the same pair of nodes in
a graph. |
class |
PartitionLayout
PartitionLayout provides a framework for layouts that are based on a divide and conquer approach. |
class |
PortCalculator
PortCalculator adjusts the final port assignments after a layout has been calculated. |
class |
PortPlacementStage
The
PortPlacementStage assigns edges to the ports specified by PortConstraint s or PortCandidate s
after calling the core layout algorithm . |
class |
RecursiveGroupLayout
This layout algorithm recursively traverses a hierarchically organized graph in a bottom-up fashion and applies a
specified layout algorithm to the contents (direct children) of each group node.
|
class |
RemoveCollinearBendsStage
The
RemoveCollinearBendsStage removes all collinear bends found in a graph. |
class |
ReverseEdgesStage
ReverseEdgesStage selectively reverses edges in a graph, while keeping the layout and label positions of the
reversed edges as close to the pre-reversal layout and positions as possible. |
class |
SelfLoopRouter
A
SelfLoopRouter routes the self-loops (reflexive edges) of a graph. |
class |
SequentialLayout
A
SequentialLayout allows for chaining multiple layout algorithms . |
class |
SubgraphLayout
A
SubgraphLayout is a ILayoutStage that filters out all graph elements that are not part of a specific
subgraph. |
Modifier and Type | Field and Description |
---|---|
static ILayoutAlgorithm |
RecursiveGroupLayout.NULL_LAYOUT
A constant that represents a
ILayoutAlgorithm implementation that does nothing. |
Modifier and Type | Field and Description |
---|---|
static NodeDpKey<ILayoutAlgorithm> |
RecursiveGroupLayout.GROUP_NODE_LAYOUT_DPKEY
A
DataProvider key for arranging the content of each group node with an individual layout algorithm.
|
static NodeDpKey<ILayoutAlgorithm> |
LayoutMultiplexer.LAYOUT_DPKEY
A
DataProvider key for assigning layout algorithms to the nodes
At runtime, the layout algorithms are determined and applied to the current graph. |
Modifier and Type | Method and Description |
---|---|
ILayoutAlgorithm |
LabelLayoutTranslator.getCoreLayout()
Gets the core layout algorithm that is wrapped by this
ILayoutStage . |
ILayoutAlgorithm |
ILayoutStage.getCoreLayout()
Gets the core layout algorithm.
|
ILayoutAlgorithm |
GraphTransformer.getCoreLayout() |
ILayoutAlgorithm |
BendConverter.getCoreLayout()
Gets the core layout algorithm that is wrapped by this
ILayoutStage . |
ILayoutAlgorithm |
AbstractLayoutStage.getCoreLayout()
Gets the core layout algorithm that is wrapped by this stage.
|
protected ILayoutAlgorithm |
LayoutMultiplexer.getCoreLayout(LayoutGraph graph)
Returns the core layout algorithm associated with the nodes contained in the given graph.
|
ILayoutAlgorithm |
RecursiveGroupLayout.getInterEdgeRouter()
Gets the current edge routing algorithm for handling inter-edges.
|
ILayoutAlgorithm |
FixGroupLayoutStage.getInterEdgeRouter()
Gets the edge routing algorithm that is applied to route the inter-edges.
|
protected ILayoutAlgorithm |
LayoutExecutor.getLayout()
Gets the
ILayoutAlgorithm this instance is using. |
Modifier and Type | Method and Description |
---|---|
ItemMapping<INode,ILayoutAlgorithm> |
RecursiveGroupLayoutData.getGroupNodeLayouts()
Gets the mapping from group nodes to the
ILayoutAlgorithm used for their child nodes. |
List<ILayoutAlgorithm> |
SequentialLayout.getLayouts()
Gets the chain of
layout algorithms . |
Modifier and Type | Method and Description |
---|---|
void |
SequentialLayout.appendLayout(ILayoutAlgorithm layouter)
Appends the given
layout algorithm to the end of the chain. |
void |
ReverseEdgesStageData.apply(LayoutGraphAdapter adapter,
ILayoutAlgorithm layout,
CopiedLayoutGraph layoutGraph) |
void |
RecursiveGroupLayoutData.apply(LayoutGraphAdapter adapter,
ILayoutAlgorithm layout,
CopiedLayoutGraph layoutGraph) |
void |
PartitionLayoutData.apply(LayoutGraphAdapter adapter,
ILayoutAlgorithm layout,
CopiedLayoutGraph layoutGraph) |
void |
PartitionGridData.apply(LayoutGraphAdapter adapter,
ILayoutAlgorithm layout,
CopiedLayoutGraph layoutGraph) |
void |
ParallelEdgeRouterData.apply(LayoutGraphAdapter adapter,
ILayoutAlgorithm layout,
CopiedLayoutGraph layoutGraph) |
abstract void |
LayoutData.apply(LayoutGraphAdapter layoutGraphAdapter,
ILayoutAlgorithm layout,
CopiedLayoutGraph layoutGraph)
Applies this layout data to the specified
layoutGraphAdapter . |
void |
FixNodeLayoutData.apply(LayoutGraphAdapter adapter,
ILayoutAlgorithm layout,
CopiedLayoutGraph layoutGraph) |
void |
FixGroupLayoutData.apply(LayoutGraphAdapter adapter,
ILayoutAlgorithm layout,
CopiedLayoutGraph layoutGraph) |
void |
CompositeLayoutData.apply(LayoutGraphAdapter adapter,
ILayoutAlgorithm layout,
CopiedLayoutGraph layoutGraph) |
void |
ComponentLayoutData.apply(LayoutGraphAdapter adapter,
ILayoutAlgorithm layout,
CopiedLayoutGraph layoutGraph) |
static void |
LayoutGraphAdapter.applyLayout(IGraph graph,
ILayoutAlgorithm layout)
Static convenience method that applies a
layout algorithm to an IGraph . |
static void |
LayoutGraphAdapter.applyLayout(IGraph graph,
ILayoutAlgorithm layout,
LayoutData layoutData)
Static convenience method that applies a
layout algorithm to an IGraph . |
void |
LayoutGraphAdapter.applyLayout(ILayoutAlgorithm layout)
Convenience method that applies a
layout algorithm to an IGraph . |
void |
LayoutGraphAdapter.applyLayout(ILayoutAlgorithm layout,
LayoutData layoutData)
Convenience method that applies a
layout algorithm to an IGraph . |
IMapper<V,Boolean> |
SingleItemCollection.provideMapper(LayoutGraphAdapter adapter,
ILayoutAlgorithm layout)
Provides a mapper describing which elements are contained in this
ItemCollection . |
IMapper<TItem,TValue> |
ItemMapping.provideMapper(LayoutGraphAdapter adapter,
ILayoutAlgorithm layout)
Provides a mapper mapping the items to values.
|
IMapper<TItem,Boolean> |
ItemCollection.provideMapper(LayoutGraphAdapter adapter,
ILayoutAlgorithm layout)
Provides a mapper describing which elements are contained in this
ItemCollection . |
IMapper<TItem,TValue> |
ContextItemMapping.provideMapper(LayoutGraphAdapter adapter,
ILayoutAlgorithm layout,
TContext context)
Provides a mapper mapping the items to values.
|
void |
LabelLayoutTranslator.setCoreLayout(ILayoutAlgorithm value)
Sets the core layout algorithm that is wrapped by this
ILayoutStage . |
void |
ILayoutStage.setCoreLayout(ILayoutAlgorithm value)
Sets the core layout algorithm.
|
void |
GraphTransformer.setCoreLayout(ILayoutAlgorithm value) |
void |
BendConverter.setCoreLayout(ILayoutAlgorithm value)
Sets the core layout algorithm that is wrapped by this
ILayoutStage . |
void |
AbstractLayoutStage.setCoreLayout(ILayoutAlgorithm value)
Sets the core layout algorithm that is wrapped by this stage.
|
void |
RecursiveGroupLayout.setInterEdgeRouter(ILayoutAlgorithm value)
Sets the current edge routing algorithm for handling inter-edges.
|
void |
FixGroupLayoutStage.setInterEdgeRouter(ILayoutAlgorithm value)
Sets the edge routing algorithm that is applied to route the inter-edges.
|
Modifier and Type | Method and Description |
---|---|
void |
SequentialLayout.appendLayouts(Collection<ILayoutAlgorithm> layouters)
Appends the specified list of
layout algorithms to the end of the chain. |
void |
RecursiveGroupLayoutData.setGroupNodeLayouts(ItemMapping<INode,ILayoutAlgorithm> value)
Sets the mapping from group nodes to the
ILayoutAlgorithm used for their child nodes. |
void |
SequentialLayout.setLayouts(List<ILayoutAlgorithm> value)
Sets the chain of
layout algorithms . |
Modifier and Type | Class and Description |
---|---|
class |
CircularLayout
This layout algorithm arranges graphs in a circular fashion.
|
class |
SingleCycleLayout
This layout algorithm places all nodes of a graph on a single cycle.
|
Modifier and Type | Method and Description |
---|---|
void |
CircularLayoutData.apply(LayoutGraphAdapter adapter,
ILayoutAlgorithm layout,
CopiedLayoutGraph layoutGraph) |
Modifier and Type | Class and Description |
---|---|
class |
FamilyTreeLayout
This layout algorithm arranges genealogical graphs (family trees).
|
Modifier and Type | Method and Description |
---|---|
ILayoutAlgorithm |
FamilyTreeLayout.getTopLayout()
Gets the
layout algorithm that is responsible for the layout between family groups. |
Modifier and Type | Method and Description |
---|---|
void |
FamilyTreeLayoutData.apply(LayoutGraphAdapter adapter,
ILayoutAlgorithm layout,
CopiedLayoutGraph layoutGraph) |
void |
FamilyTreeLayout.setTopLayout(ILayoutAlgorithm value)
Sets the
layout algorithm that is responsible for the layout between family groups. |
Modifier and Type | Class and Description |
---|---|
class |
HierarchicLayout
This layout algorithm arranges graphs in a hierarchic fashion.
|
class |
HierarchicLayoutCore
This class arranges graphs in a hierarchic/layered fashion and supports complete re-layout as well as incremental graph
layout.
|
class |
PartitionGridLayoutStage
This class implements a
layout stage that handles a given partition grid
structure. |
class |
TopLevelGroupToSwimlaneStage
This
layout stage can be used for automatically assigning SwimlaneDescriptor
instances to nodes by treating top-level group nodes as swimlanes. |
Modifier and Type | Method and Description |
---|---|
void |
SelfLoopCalculatorData.apply(LayoutGraphAdapter adapter,
ILayoutAlgorithm layout,
CopiedLayoutGraph layoutGraph) |
void |
HierarchicLayoutData.apply(LayoutGraphAdapter adapter,
ILayoutAlgorithm layout,
CopiedLayoutGraph layoutGraph) |
IMapper<IModelItem,Object> |
IncrementalHintItemMapping.provideMapper(LayoutGraphAdapter adapter,
ILayoutAlgorithm layout,
IIncrementalHintsFactory hintsFactory) |
Modifier and Type | Class and Description |
---|---|
class |
AbstractLabeling
An abstract base class for generic labeling algorithms which place labels of graphs.
|
class |
AbstractMISLabeling
A base class for generic labeling algorithms which solve the labeling problem by reducing it to the maximum independent
set (MIS) problem.
|
class |
GenericLabeling
A generic labeling algorithm for placing the labels of a graph.
|
Modifier and Type | Method and Description |
---|---|
void |
LabelingData.apply(LayoutGraphAdapter adapter,
ILayoutAlgorithm layout,
CopiedLayoutGraph layoutGraph) |
Modifier and Type | Class and Description |
---|---|
class |
MultiPageLayout
This layout algorithm subdivides the input graph into several
LayoutGraph s (called page graphs) such that the
layout (calculated by the specified core layout algorithm ) of each graph
fits the specified maximum page size . |
Modifier and Type | Method and Description |
---|---|
void |
MultiPageLayoutData.apply(LayoutGraphAdapter adapter,
ILayoutAlgorithm layout,
CopiedLayoutGraph layoutGraph) |
Constructor and Description |
---|
MultiPageLayout(ILayoutAlgorithm core)
Creates a new
MultiPageLayout instance. |
Modifier and Type | Class and Description |
---|---|
class |
ClassicOrganicLayout
A layout algorithm that arranges graphs in an organic fashion, using a force-directed drawing approach.
|
class |
InteractiveOrganicLayout
This algorithm arranges graphs in an organic fashion and offers special functionality to interact with the graph while
the algorithm is running.
|
class |
OrganicLayout
This layout algorithm arranges graphs in an organic fashion.
|
class |
OrganicPartitionGridLayoutStage
This layout stage enables support for handling a graph with a
PartitionGrid structure. |
class |
OrganicRemoveOverlapsStage
This layout stage removes node overlaps while changes to the original layout structure are avoided and a specified
minimum node distance is guaranteed.
|
class |
RecursiveShuffleLayout
This algorithm recursively removes node overlaps from a graph with a hierarchic group structure.
|
class |
RemoveOverlapsStage
This
ILayoutStage removes node overlaps and guarantees a certain minimum distance between nodes. |
class |
ShuffleLayout
This layout algorithm removes overlaps between nodes in a graph.
|
class |
SplitEdgeStage
This layout stage replaces edges by a path of split-edges with a specified length before it calls a
core layout algorithm . |
Modifier and Type | Method and Description |
---|---|
ILayoutAlgorithm |
SplitEdgeStage.getCoreLayout() |
ILayoutAlgorithm |
ShuffleLayout.getCoreLayout() |
ILayoutAlgorithm |
RemoveOverlapsStage.getCoreLayout() |
ILayoutAlgorithm |
RecursiveShuffleLayout.getShuffleLayout()
Gets the
ILayoutAlgorithm instance that is used for removing node overlaps. |
Modifier and Type | Method and Description |
---|---|
void |
OrganicLayoutData.apply(LayoutGraphAdapter adapter,
ILayoutAlgorithm layout,
CopiedLayoutGraph layoutGraph) |
void |
SplitEdgeStage.setCoreLayout(ILayoutAlgorithm value) |
void |
ShuffleLayout.setCoreLayout(ILayoutAlgorithm value) |
void |
RemoveOverlapsStage.setCoreLayout(ILayoutAlgorithm value) |
void |
RecursiveShuffleLayout.setShuffleLayout(ILayoutAlgorithm value)
Sets the
ILayoutAlgorithm instance that is used for removing node overlaps. |
Constructor and Description |
---|
OrganicPartitionGridLayoutStage(ILayoutAlgorithm core)
Creates a new instance of
OrganicPartitionGridLayoutStage with the given layout algorithm as
core algorithm . |
OrganicRemoveOverlapsStage(ILayoutAlgorithm core)
Creates a new instance of
OrganicRemoveOverlapsStage with an optional
core layout algorithm . |
RecursiveShuffleLayout(ILayoutAlgorithm core)
Creates a new
RecursiveShuffleLayout instance with an optional
core layout algorithm . |
Modifier and Type | Class and Description |
---|---|
class |
CompactOrthogonalLayout
This layout algorithm arranges a graph in a compact, orthogonal fashion.
|
class |
OrthogonalLayout
This layout algorithm arranges graphs in an orthogonal fashion.
|
Modifier and Type | Method and Description |
---|---|
void |
OrthogonalLayoutData.apply(LayoutGraphAdapter adapter,
ILayoutAlgorithm layout,
CopiedLayoutGraph layoutGraph) |
Modifier and Type | Class and Description |
---|---|
class |
PartialLayout
This class represents a partial layout algorithm which changes the coordinates for a given set of graph elements (called
partial elements) only.
|
Modifier and Type | Method and Description |
---|---|
ILayoutAlgorithm |
PartialLayout.getCoreLayout()
Gets the
ILayoutAlgorithm instance that is applied to each subgraph component. |
ILayoutAlgorithm |
PartialLayout.getEdgeRouter()
Gets the custom edge router instance that is used for partial edges and edges between different subgraph components
(so-called inter-edges).
|
Modifier and Type | Method and Description |
---|---|
void |
PartialLayoutData.apply(LayoutGraphAdapter adapter,
ILayoutAlgorithm layout,
CopiedLayoutGraph layoutGraph) |
protected void |
PartialLayout.configureEdgeRouter(ILayoutAlgorithm edgeRouter)
This method is called each time when edges are routed with an edge router.
|
void |
PartialLayout.setCoreLayout(ILayoutAlgorithm value)
Sets the
ILayoutAlgorithm instance that is applied to each subgraph component. |
void |
PartialLayout.setEdgeRouter(ILayoutAlgorithm value)
Sets the custom edge router instance that is used for partial edges and edges between different subgraph components
(so-called inter-edges).
|
Constructor and Description |
---|
PartialLayout(ILayoutAlgorithm subgraphLayouter)
Creates a new instance of
PartialLayout which uses the specified ILayoutAlgorithm instance as the core
layout algorithm. |
Modifier and Type | Class and Description |
---|---|
class |
RadialLayout
This layout algorithm arranges graphs in a radial fashion.
|
Modifier and Type | Method and Description |
---|---|
void |
RadialLayoutData.apply(LayoutGraphAdapter adapter,
ILayoutAlgorithm layout,
CopiedLayoutGraph layoutGraph) |
Modifier and Type | Class and Description |
---|---|
class |
BusRouter
An edge routing algorithm which routes edges of a graph in an orthogonal bus-style.
|
class |
ChannelEdgeRouter
This edge routing algorithm generates orthogonal routes for the edges of the graph.
|
class |
OrganicEdgeRouter
This edge routing algorithm applies organic routes to the edges of the graph.
|
class |
OrthogonalPatternEdgeRouter
OrthogonalPatternEdgeRouter routes edges orthogonally such that the resulting layout of the edges consists only
of vertical and horizontal segments. |
class |
OrthogonalSegmentDistributionStage
OrthogonalSegmentDistributionStage distributes overlapping edge segments of orthogonally routed edges. |
class |
SnapOuterPortsToNodeBorderStage
SnapOuterPortsToNodeBorderStage moves edge ports that are outside the corresponding area of the nodes to their
border. |
class |
StraightLineEdgeRouter
This edge routing algorithm routes edges as straight-lines considering the specified
PortConstraint s. |
Modifier and Type | Method and Description |
---|---|
ILayoutAlgorithm |
OrganicEdgeRouter.getCoreLayout()
Gets the core layout algorithm which arranges the graph before edge routing.
|
ILayoutAlgorithm |
ChannelEdgeRouter.getEdgeDistributionStrategy()
Gets the strategy for the edge distribution step.
|
ILayoutAlgorithm |
ChannelEdgeRouter.getPathFinderStrategy()
Gets the strategy for the path finding step.
|
Modifier and Type | Method and Description |
---|---|
void |
StraightLineEdgeRouterData.apply(LayoutGraphAdapter adapter,
ILayoutAlgorithm layout,
CopiedLayoutGraph layoutGraph) |
void |
OrthogonalPatternEdgeRouterData.apply(LayoutGraphAdapter adapter,
ILayoutAlgorithm layout,
CopiedLayoutGraph layoutGraph) |
void |
OrganicEdgeRouterData.apply(LayoutGraphAdapter adapter,
ILayoutAlgorithm layout,
CopiedLayoutGraph layoutGraph) |
void |
ChannelEdgeRouterData.apply(LayoutGraphAdapter adapter,
ILayoutAlgorithm layout,
CopiedLayoutGraph layoutGraph) |
void |
BusRouterData.apply(LayoutGraphAdapter adapter,
ILayoutAlgorithm layout,
CopiedLayoutGraph layoutGraph) |
void |
OrganicEdgeRouter.setCoreLayout(ILayoutAlgorithm value)
Sets the core layout algorithm which arranges the graph before edge routing.
|
void |
ChannelEdgeRouter.setEdgeDistributionStrategy(ILayoutAlgorithm value)
Sets the strategy for the edge distribution step.
|
void |
ChannelEdgeRouter.setPathFinderStrategy(ILayoutAlgorithm value)
Sets the strategy for the path finding step.
|
Constructor and Description |
---|
OrganicEdgeRouter(ILayoutAlgorithm core)
Creates a new
OrganicEdgeRouter with the given core layout algorithm . |
StraightLineEdgeRouter(ILayoutAlgorithm core)
Creates a new instance of
StraightLineEdgeRouter with an optional
core layout algorithm . |
Modifier and Type | Class and Description |
---|---|
class |
EdgeRouter
This edge routing algorithm applies polyline routes to the edges of the graph.
|
class |
PolylineLayoutStage
PolylineLayoutStage extends the orthogonal edge paths with polyline segments. |
Modifier and Type | Method and Description |
---|---|
void |
PolylineEdgeRouterData.apply(LayoutGraphAdapter adapter,
ILayoutAlgorithm layout,
CopiedLayoutGraph layoutGraph) |
Constructor and Description |
---|
EdgeRouter(ILayoutAlgorithm core)
Creates a new
EdgeRouter instance with an optional
core layout algorithm . |
PolylineLayoutStage(ILayoutAlgorithm coreLayouter)
Creates a new instance of
PolylineLayoutStage using the given
core layout algorithm . |
Modifier and Type | Class and Description |
---|---|
class |
SeriesParallelLayout
This layout algorithm arranges series-parallel graphs.
|
Modifier and Type | Method and Description |
---|---|
ILayoutAlgorithm |
SeriesParallelLayout.getNonSeriesParallelEdgeLabelingAlgorithm()
Gets the labeling algorithm that is applied to all edge labels that belong to non-series-parallel edges.
|
ILayoutAlgorithm |
SeriesParallelLayout.getNonSeriesParallelEdgeRouter()
Gets the edge routing algorithm used for the edges of a general graph that are not part of the series-parallel subgraph
whose layout is calculated.
|
Modifier and Type | Method and Description |
---|---|
void |
SeriesParallelLayoutData.apply(LayoutGraphAdapter adapter,
ILayoutAlgorithm layout,
CopiedLayoutGraph layoutGraph) |
void |
SeriesParallelLayout.setNonSeriesParallelEdgeLabelingAlgorithm(ILayoutAlgorithm value)
Sets the labeling algorithm that is applied to all edge labels that belong to non-series-parallel edges.
|
void |
SeriesParallelLayout.setNonSeriesParallelEdgeRouter(ILayoutAlgorithm value)
Sets the edge routing algorithm used for the edges of a general graph that are not part of the series-parallel subgraph
whose layout is calculated.
|
Modifier and Type | Class and Description |
---|---|
class |
AspectRatioTreeLayout
The
AspectRatioTreeLayout arranges tree graphs in a compact fashion. |
class |
BalloonLayout
A tree layout algorithm that arranges the subtrees of the tree in a balloon-like fashion.
|
class |
ClassicTreeLayout
This layout algorithm arranges graphs with a tree structure.
|
class |
TreeComponentLayout
The
TreeComponentLayout arranges tree-like subgraph structures in a mixed layout style. |
class |
TreeLayout
This layout algorithm arranges graphs with a tree structure.
|
class |
TreeReductionStage
The
TreeReductionStage temporarily reduces general graphs to trees. |
Modifier and Type | Method and Description |
---|---|
ILayoutAlgorithm |
TreeReductionStage.createStraightLineRouter()
Creates a routing algorithm that routes edges as a single straight segment.
|
ILayoutAlgorithm |
TreeComponentLayout.getCoreLayout() |
ILayoutAlgorithm |
TreeReductionStage.getNonTreeEdgeLabelingAlgorithm()
Gets the labeling algorithm that is applied to all edge labels that belong to non-tree edges.
|
ILayoutAlgorithm |
TreeReductionStage.getNonTreeEdgeRouter()
Gets the edge routing algorithm that is applied to all non-tree edges.
|
ILayoutAlgorithm |
TreeComponentLayout.getTreeComponentCoreLayout()
Gets the layout algorithm that is applied to tree components.
|
Modifier and Type | Method and Description |
---|---|
void |
TreeReductionStageData.apply(LayoutGraphAdapter adapter,
ILayoutAlgorithm layout,
CopiedLayoutGraph layoutGraph) |
void |
TreeLayoutData.apply(LayoutGraphAdapter adapter,
ILayoutAlgorithm layout,
CopiedLayoutGraph layoutGraph) |
void |
BalloonLayoutData.apply(LayoutGraphAdapter adapter,
ILayoutAlgorithm layout,
CopiedLayoutGraph layoutGraph) |
void |
AspectRatioTreeLayoutData.apply(LayoutGraphAdapter adapter,
ILayoutAlgorithm layout,
CopiedLayoutGraph layoutGraph) |
void |
TreeComponentLayout.setCoreLayout(ILayoutAlgorithm value) |
void |
TreeReductionStage.setNonTreeEdgeLabelingAlgorithm(ILayoutAlgorithm value)
Sets the labeling algorithm that is applied to all edge labels that belong to non-tree edges.
|
void |
TreeReductionStage.setNonTreeEdgeRouter(ILayoutAlgorithm value)
Sets the edge routing algorithm that is applied to all non-tree edges.
|
void |
TreeComponentLayout.setTreeComponentCoreLayout(ILayoutAlgorithm value)
Sets the layout algorithm that is applied to tree components.
|
Constructor and Description |
---|
TreeComponentLayout(ILayoutAlgorithm treeCoreLayouter)
Creates a new
TreeComponentLayout instance using the specified layouter for arranging the subtrees. |
TreeReductionStage(ILayoutAlgorithm core)
Creates a new
TreeReductionStage instance with the given core layout algorithm and default settings. |
Modifier and Type | Method and Description |
---|---|
void |
GraphControl.morphLayout(ILayoutAlgorithm layout,
Duration morphDuration)
Convenience method that runs a layout on the graph of a given graph control, animates the transition, and calls the
given
doneHandler once the animation has finished. |
void |
GraphControl.morphLayout(ILayoutAlgorithm layout,
Duration morphDuration,
IEventHandler<LayoutEventArgs> doneHandler)
Convenience method that runs a layout on the graph of a given graph control, animates the transition, and calls the
given
doneHandler once the animation has finished. |
void |
GraphControl.morphLayout(ILayoutAlgorithm layout,
Duration morphDuration,
LayoutData layoutData)
Convenience method that runs a layout on the graph of a given graph control, animates the transition, and calls the
given
doneHandler once the animation has finished. |
void |
GraphControl.morphLayout(ILayoutAlgorithm layout,
Duration morphDuration,
LayoutData layoutData,
IEventHandler<LayoutEventArgs> doneHandler)
Convenience method that runs a layout on the graph of a given graph control, animates the transition, and calls the
given
doneHandler once the animation has finished. |