|
Search this API | ||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Object y.layout.PartitionLayouter.ComponentPartitionPlacer
public static class PartitionLayouter.ComponentPartitionPlacer
PartitionPlacer implementation that uses ComponentLayouter
to place
the partitions.
Constructor Summary | |
---|---|
PartitionLayouter.ComponentPartitionPlacer()
Creates a new instance of this class. |
Method Summary | |
---|---|
ComponentLayouter |
getComponentLayouter()
Returns the ComponentLayouter instance used to place the graph partitions. |
void |
placePartitions(LayoutGraph graph,
DataProvider clusterIDDP,
DataProvider interEdgeDP)
Arranges the graph while taking partition ids and inter-edge information into account. |
void |
setComponentLayouter(ComponentLayouter componentLayouter)
Sets the ComponentLayouter instance used to place the graph partitions. |
Methods inherited from class java.lang.Object |
---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Constructor Detail |
---|
public PartitionLayouter.ComponentPartitionPlacer()
Method Detail |
---|
public void placePartitions(LayoutGraph graph, DataProvider clusterIDDP, DataProvider interEdgeDP)
PartitionLayouter.PartitionPlacer
placePartitions
in interface PartitionLayouter.PartitionPlacer
graph
- the input graphclusterIDDP
- 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. An inter-edge is an edge that connects nodes that do not
belong to the same partition.public ComponentLayouter getComponentLayouter()
public void setComponentLayouter(ComponentLayouter componentLayouter)
|
© Copyright 2000-2013, yWorks GmbH. All rights reserved. |
||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |