public class OrthogonalEdgeRouter : AbstractLayoutStage

Public Class OrthogonalEdgeRouter _
	Inherits AbstractLayoutStage

This class represents an orthogonal edge router. An orthogonal edge router is a layout algorithm that changes the coordinates of the edge paths in a way that the resulting layout of the edges is made up of vertical and horizontal segments only. The router does not change the location or the size of the nodes in a diagram in any way.

Several LayoutStages can be used to enhance performance and/or functionality of this class, e.g. EdgeGroupRouterStage , GroupNodeRouterStage , ReducedSphereOfActionStage or PatchRouterStage .

This edge router will obey strong and weak port constraints. It expects the port constraints to be bound to the input graph by the data provider keys SourcePortConstraintDpKey and TargetPortConstraintDpKey . Furthermore, this class supports the more advanced port constraint concept of PortCandidate s. It expects collections of port candidates to be bound to the input graph by the data provider keys SourcePcListDpKey and TargetPcListDpKey .

The router often finds ideal routes in difficult situations like the one depicted below.

System..::..Object
  yWorks.yFiles.Layout..::..AbstractLayoutStage
    yWorks.yFiles.Layout.Router..::..OrthogonalEdgeRouter
      yWorks.yFiles.Layout.Router..::..ChannelEdgeRouter..::..OrthogonalShortestPathPathFinder