Search this API

y.layout.planar
Class EdgeRouter

java.lang.Object
  extended by y.layout.planar.EdgeRouter

public class EdgeRouter
extends java.lang.Object

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

 
Your browser does not support SVG content.

Constructor Summary
EdgeRouter(PlanarInformation _planar)
           
 
Method Summary
 long getMaximumDuration()
           
 void insertEdges(EdgeList edges)
          Inserts a list of edges into the graph by routing through the dual graph.
 int insertEdgesVirtual(EdgeList edges)
           
 void rerouteEdges(EdgeList edges)
          this method tries to find better paths for all edges that caused crossings.
 void rerouteEdges(int iter, EdgeList edges)
          this method tries to find better paths for all edges that caused crossings.
 void setMaximumDuration(long maximumDuration)
           
 
Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
 

Constructor Detail

EdgeRouter

public EdgeRouter(PlanarInformation _planar)
Method Detail

getMaximumDuration

public long getMaximumDuration()

setMaximumDuration

public void setMaximumDuration(long maximumDuration)

insertEdges

public void insertEdges(EdgeList edges)
Inserts a list of edges into the graph by routing through the dual graph.

Parameters:
edges - the edges to be routed routed.

insertEdgesVirtual

public int insertEdgesVirtual(EdgeList edges)

rerouteEdges

public void rerouteEdges(int iter,
                         EdgeList edges)
this method tries to find better paths for all edges that caused crossings.

Precondition:
is a valid dual graph
Parameters:
iter - 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

rerouteEdges

public void rerouteEdges(EdgeList edges)
this method tries to find better paths for all edges that caused crossings.


© Copyright 2000-2022,
yWorks GmbH.
All rights reserved.