y.layout.planar
Class EdgeRouter

java.lang.Object
  |
  +--y.layout.planar.EdgeRouter

public class EdgeRouter

extends Object

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

Constructor Summary

EdgeRouter(PlanarInformation _planar)

Method Summary

boolean	getUseSmartrouting() Returns if smart routing should be used.
void	insertEdges(EdgeList edges) Inserts a list of edges into the graph by routing through the dual graph.
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	setUseSmartRouting(boolean value) Sets if smart routing should be used.

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

setUseSmartRouting

public void setUseSmartRouting(boolean value)

Sets if smart routing should be used.

getUseSmartrouting

public boolean getUseSmartrouting()

Returns if smart routing should be used.

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.

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.