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: 2.1.0.2

Syntax

C#
public class SelfLoopLayouter : AbstractLayoutStage
Visual Basic
Public Class SelfLoopLayouter _
	Inherits AbstractLayoutStage

Remarks

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:

  1. Remove all self-loops of the input graph
  2. Invoke the core layouter on the now self-loops free graph
  3. Reinsert all formerly removed self-loops of the graph
  4. Layout the self-loops of the input graph

Inheritance Hierarchy

System..::..Object
  yWorks.yFiles.Layout..::..AbstractLayoutStage
    yWorks.yFiles.Layout..::..SelfLoopLayouter

See Also