A layout algorithm that routes parallel edges (edges that connect the same pair of nodes) of a graph.
Namespace: yWorks.yFiles.LayoutAssembly: yWorks.yFilesWPF.Algorithms (in yWorks.yFilesWPF.Algorithms.dll) Version: 2.2.0.2 (2.2.0.2)
Syntax
| C# |
|---|
public class ParallelEdgeLayouter : AbstractLayoutStage |
| Visual Basic |
|---|
Public Class ParallelEdgeLayouter _ Inherits AbstractLayoutStage |
Remarks
A layout algorithm that routes parallel edges (edges that connect the same pair of nodes) of a graph.
A core layout algorithm can be specified for this class. In that case the performed layout process of this class
is subdivided into four stages:
- Remove parallel edges from the input graph. If there are parallel edges between two nodes A and B than only one of these edges will remain in the graph. The remaining edge is called the leading edge and is the representative of the other edges.
- Invoke the core layouter on the now parallel edge free graph.
- Reinsert all formerly removed edges of the graph.
- Route the parallel edges such that they run in parallel to their leading edge which was routed by the core layouter.
Inheritance Hierarchy
System..::..Object
yWorks.yFiles.Layout..::..AbstractLayoutStage
yWorks.yFiles.Layout..::..ParallelEdgeLayouter
yWorks.yFiles.Layout..::..AbstractLayoutStage
yWorks.yFiles.Layout..::..ParallelEdgeLayouter