Implementations of this interface are responsible for routing inter-edges.
An inter-edge is an edge that connects nodes that do not belong to the same partition.
public function routeInterEdges(graph:LayoutGraph, partitionIDDP:DataProvider, interEdgeDP:DataProvider):void
Routes inter-edges of the partitioned graph.
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.
|
Wed Oct 7 2015, 04:43 PM +02:00