Implementations of this interface are responsible for arranging the graph partitions.
Arranging a graph partition usually involves to apply a coordinate translation to all elements belonging to the partition in order to generate a non-overlapping node-arrangement.
public function placePartitions(graph:LayoutGraph, partitionIDDP:DataProvider, interEdgeDP:DataProvider):void
Arranges the graph while taking partition ids and inter-edge information into account.
Parameters
| graph:LayoutGraph — the input graph
|
| |
| partitionIDDP:DataProvider — the partition id for each node in the graph.
|
| |
| interEdgeDP:DataProvider — 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.
|
Wed Oct 7 2015, 04:43 PM +02:00 