public static interface PartitionLayout.IPartitionPlacer
PartitionLayout.IPartitionPlacer
is responsible for arranging the graph partitions.
Arranging a graph partition usually involves applying a coordinate translation to all elements that belong to the partition in order to generate a non-overlapping node arrangement.
Modifier and Type | Method and Description |
---|---|
static PartitionLayout.IPartitionPlacer |
createComponentPartitionPlacer()
Creates a
PartitionLayout.IPartitionPlacer that uses ComponentLayout to place the partitions. |
static PartitionLayout.IPartitionPlacer |
createComponentPartitionPlacer(ComponentLayout componentLayout)
Creates a
PartitionLayout.IPartitionPlacer that uses ComponentLayout to place the partitions. |
void |
placePartitions(LayoutGraph graph,
IDataProvider partitionIDDP,
IDataProvider interEdgeDP)
Arranges the graph while taking partition IDs and inter-edge information into account.
|
static PartitionLayout.IPartitionPlacer createComponentPartitionPlacer()
PartitionLayout.IPartitionPlacer
that uses ComponentLayout
to place the partitions.static PartitionLayout.IPartitionPlacer createComponentPartitionPlacer(ComponentLayout componentLayout)
PartitionLayout.IPartitionPlacer
that uses ComponentLayout
to place the partitions.componentLayout
- An optional ComponentLayout
to use.void placePartitions(LayoutGraph graph, IDataProvider partitionIDDP, IDataProvider interEdgeDP)
Edges which connect nodes that belong to two different partitions are called inter-edges
graph
- the input graphpartitionIDDP
- the partition ID for each node in the graphinterEdgeDP
- the map which marks inter-edges