|
Search this API | ||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||
java.lang.Objecty.layout.PartitionLayouter.ChannelInterEdgeRouter
public static class PartitionLayouter.ChannelInterEdgeRouter
InterEdgeRouter implementation that routes inter-edges using
ChannelEdgeRouter.
| Constructor Summary | |
|---|---|
PartitionLayouter.ChannelInterEdgeRouter()
Creates a new instance of this class. |
|
| Method Summary | |
|---|---|
ChannelEdgeRouter |
getChannelEdgeRouter()
Returns the ChannelEdgeRouter instance used to route inter-edges. |
Object |
getInterEdgeDPKey()
Returns the DataProvider key which is used to register the
inter-edge data provider passed to
routeInterEdges(LayoutGraph, y.base.DataProvider, y.base.DataProvider)
on the given graph. |
double |
getMargin()
Returns the maximum relative distance between an edge and its closest node for edges routed outside the bounding box of all graph nodes. |
boolean |
isRouteInterEdgesOnly()
Returns true if this ChannelInterEdgeRouter
is configured to route inter-partition edges only. |
void |
routeInterEdges(LayoutGraph graph,
DataProvider partitionIDDP,
DataProvider interEdgeDP)
Routes inter-edges of the partitioned graph. |
void |
setChannelEdgeRouter(ChannelEdgeRouter router)
Sets the ChannelEdgeRouter instance used to route inter-edges. |
void |
setInterEdgeDPKey(Object key)
Specifies the DataProvider key which is used to register the
inter-edge data provider passed to
routeInterEdges(LayoutGraph, y.base.DataProvider, y.base.DataProvider)
on the given graph. |
void |
setMargin(double margin)
Specifies the maximum relative distance between an edge and its closest node for edges that are routed outside the bounding box of all graph nodes. |
void |
setRouteInterEdgesOnly(boolean b)
Specifies whether to route inter-partition edges only. |
| Methods inherited from class java.lang.Object |
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
| Constructor Detail |
|---|
public PartitionLayouter.ChannelInterEdgeRouter()
| Method Detail |
|---|
public boolean isRouteInterEdgesOnly()
true if this ChannelInterEdgeRouter
is configured to route inter-partition edges only.
By default, all edges are routed, i.e. routeInterEdgesOnly
is set to false.
routeInterEdges(LayoutGraph, y.base.DataProvider, y.base.DataProvider)public void setRouteInterEdgesOnly(boolean b)
routeInterEdgesOnly
is set to false.
routeInterEdges(LayoutGraph, y.base.DataProvider, y.base.DataProvider)public Object getInterEdgeDPKey()
DataProvider key which is used to register the
inter-edge data provider passed to
routeInterEdges(LayoutGraph, y.base.DataProvider, y.base.DataProvider)
on the given graph.
DataProvider key used to register the inter-edge
data providerpublic void setInterEdgeDPKey(Object key)
DataProvider key which is used to register the
inter-edge data provider passed to
routeInterEdges(LayoutGraph, y.base.DataProvider, y.base.DataProvider)
on the given graph. Defaults to Layouter.SELECTED_EDGES.
key - the DataProvider key used to register the inter-edge
data providerpublic ChannelEdgeRouter getChannelEdgeRouter()
ChannelEdgeRouter instance used to route inter-edges.
public void setChannelEdgeRouter(ChannelEdgeRouter router)
ChannelEdgeRouter instance used to route inter-edges.
public double getMargin()
setMargin(double)public void setMargin(double margin)
dist(edge, bounding box) <= (bounding box width) * margin
and edges above or below the nodes' bounding box must satisfy
dist(edge, bounding box) <= (bounding box height) * margin.
Passing in a negative value effectively allow edges to be arbitrarily
far from their closest nodes.
By default margin is set to -1.0.
margin - the maximum horizontal distance between edge and
closest node.
public void routeInterEdges(LayoutGraph graph,
DataProvider partitionIDDP,
DataProvider interEdgeDP)
interEdgeDP
on the specified input graph before/after doing any actual routing.
routeInterEdges in interface PartitionLayouter.InterEdgeRoutergraph - the input graph.partitionIDDP - the partition id for each node in the graph.interEdgeDP - holds a boolean value for each edge of the graph
indicating if the edge is an inter-edge or not.getInterEdgeDPKey(),
setInterEdgeDPKey(Object)
|
© Copyright 2000-2013, yWorks GmbH. All rights reserved. |
||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||