A layout algorithm that routes the self-loops (reflexive edges) of a graph.Namespace: yWorks.yFiles.Layout
Assembly: yWorks.yFilesSilverlight.Algorithms (in yWorks.yFilesSilverlight.Algorithms.dll) Version: 220.127.116.11
A layout algorithm that routes the self-loops (reflexive edges) of a graph. By default, this layouter routes self-loops in an orthogonal fashion. It places the self-loop in the least crowded quadrant around a node.
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 all self-loops of the input graph
- Invoke the core layouter on the now self-loops free graph
- Reinsert all formerly removed self-loops of the graph
- Layout the self-loops of the input graph