|
Search this API | ||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Object y.layout.AbstractLayoutStage y.layout.router.EdgeGroupRouterStage
public class EdgeGroupRouterStage
Layout stage for OrthogonalEdgeRouter
that adds support for a bus-like routing style. Edges that connect to a
common node can be marked as grouped by using the data provider keys PortConstraintKeys.SOURCE_GROUPID_KEY
or
PortConstraintKeys.TARGET_GROUPID_KEY
. This stage tries to route grouped edges on a vertical or horizontal
bus. The edges will connect to their common node at the same port coordinate. There are some limitations to this
stage:
Field Summary |
---|
Fields inherited from interface y.layout.Layouter |
---|
EDGE_ID_DPKEY, NODE_ID_DPKEY, SELECTED_EDGES, SELECTED_NODES |
Constructor Summary | |
---|---|
EdgeGroupRouterStage(Layouter coreLayouter)
|
Method Summary | |
---|---|
boolean |
canLayout(LayoutGraph graph)
Returns true iff the given graph can be laid
out by this algorithm. |
void |
doLayout(LayoutGraph graph)
Main layout routine that assigns new layout information to the given graph. |
double |
getMinimalBusDistance()
Returns the minimal distance between a bus formed by an edge group and the nodes the grouped edges connect to. |
void |
setMinimalBusDistance(double minimalBusDistance)
Sets the minimal distance between a bus formed by an edge group and the nodes the grouped edges connect to. |
Methods inherited from class y.layout.AbstractLayoutStage |
---|
canLayoutCore, doLayoutCore, getCoreLayouter, setCoreLayouter |
Methods inherited from class java.lang.Object |
---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Constructor Detail |
---|
public EdgeGroupRouterStage(Layouter coreLayouter)
Method Detail |
---|
public double getMinimalBusDistance()
15.0
.
public void setMinimalBusDistance(double minimalBusDistance)
15.0
.
public boolean canLayout(LayoutGraph graph)
Layouter
true
iff the given graph can be laid
out by this algorithm. Calling doLayout
with
the given graph as its argument will only success if
this method returns true
.
public void doLayout(LayoutGraph graph)
Layouter
|
© Copyright 2000-2013, yWorks GmbH. All rights reserved. |
||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |