Packagecom.yworks.yfiles.layout.planar
Classpublic class EdgeRouter
InheritanceEdgeRouter Inheritance YObject Inheritance Object

Instances of this class route edges through a planar graph using it's dual graph


Public Methods
 MethodDefined By
  
EdgeRouter(_planar:PlanarInformation, init:Boolean = true)
EdgeRouter
 Inherited
equals(o:Object):Boolean
YObject
  
getClass():Class
[override]
EdgeRouter
 Inherited
hashCode():int
YObject
  
insertEdges(edges:EdgeList):void
Inserts a list of edges into the graph by routing through the dual graph.
EdgeRouter
  
insertEdgesVirtual(edges:EdgeList):int
EdgeRouter
  
newEdgeRouter(_planar:PlanarInformation):EdgeRouter
[static]
EdgeRouter
  
rerouteEdges(edges:EdgeList):void
this method tries to find better paths for all edges that caused crossings.
EdgeRouter
  
rerouteEdgesWithMaxIterations(iter:int, edges:EdgeList):void
this method tries to find better paths for all edges that caused crossings.
EdgeRouter
Protected Methods
 MethodDefined By
  
initEdgeRouter(_planar:PlanarInformation):void
Initializes this object.
EdgeRouter
Constructor Detail
EdgeRouter()Constructor
public function EdgeRouter(_planar:PlanarInformation, init:Boolean = true)

Parameters
_planar:PlanarInformation
 
init:Boolean (default = true) — An internally used switch to help handle proper instance initialization in inheritance chains where classes can have multiple constructor-like factory methods. This parameter can safely be ignored/omitted when calling the constructor.
Method Detail
getClass()method
override public function getClass():Class

Returns
Class
initEdgeRouter()method 
protected final function initEdgeRouter(_planar:PlanarInformation):void

Initializes this object. See the documentation of the corresponding factory method newEdgeRouter() for details.

Parameters

_planar:PlanarInformation

See also

newEdgeRouter()
insertEdges()method 
public function insertEdges(edges:EdgeList):void

Inserts a list of edges into the graph by routing through the dual graph.

Parameters

edges:EdgeList — the edges to be routed routed.

insertEdgesVirtual()method 
public function insertEdgesVirtual(edges:EdgeList):int

Parameters

edges:EdgeList

Returns
int
newEdgeRouter()method 
public static function newEdgeRouter(_planar:PlanarInformation):EdgeRouter

Parameters

_planar:PlanarInformation

Returns
EdgeRouter
rerouteEdges()method 
public function rerouteEdges(edges:EdgeList):void

this method tries to find better paths for all edges that caused crossings.

Parameters

edges:EdgeList

rerouteEdgesWithMaxIterations()method 
public function rerouteEdgesWithMaxIterations(iter:int, edges:EdgeList):void

this method tries to find better paths for all edges that caused crossings.

Precondition is a valid dual graph

Parameters

iter:int — number of iterations to perform, a value less or equal to zero causes the the method to run until the best possible result is found
 
edges:EdgeList





Wed Oct 7 2015, 04:43 PM +02:00