|
Search this API | ||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Object y.layout.planar.EdgeRouter
public class EdgeRouter
Instances of this class route edges through a planar graph using it's dual graph
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 |
---|
public EdgeRouter(PlanarInformation _planar)
Method Detail |
---|
public long getMaximumDuration()
public void setMaximumDuration(long maximumDuration)
public void insertEdges(EdgeList edges)
edges
- the edges to be routed routed.public int insertEdgesVirtual(EdgeList edges)
public void rerouteEdges(int iter, EdgeList edges)
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 foundpublic void rerouteEdges(EdgeList edges)
|
© Copyright 2000-2022, yWorks GmbH. All rights reserved. |
||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |