com.yworks.yfiles.layout

Interface PartitionLayout.IPartitionFinder

Enclosing class:

PartitionLayout

public static interface PartitionLayout.IPartitionFinder

A PartitionLayout.IPartitionFinder is responsible for partitioning the input graph.

Method Summary

Modifier and Type	Method and Description
static PartitionLayout.IPartitionFinder	createEdgeBetweennessPartitionFinder() Creates a PartitionLayout.IPartitionFinder that uses Groups.edgeBetweennessClustering(com.yworks.yfiles.algorithms.Graph, INodeMap, boolean, int, int, IDataProvider) as strategy for finding graph partitions.
static PartitionLayout.IPartitionFinder	createEdgeBetweennessPartitionFinder(int minimumPartitionCount) Creates a PartitionLayout.IPartitionFinder that uses Groups.edgeBetweennessClustering(com.yworks.yfiles.algorithms.Graph, INodeMap, boolean, int, int, IDataProvider) as strategy for finding graph partitions.
static PartitionLayout.IPartitionFinder	createEdgeBetweennessPartitionFinder(int minimumPartitionCount, int maximumPartitionCount) Creates a PartitionLayout.IPartitionFinder that uses Groups.edgeBetweennessClustering(com.yworks.yfiles.algorithms.Graph, INodeMap, boolean, int, int, IDataProvider) as strategy for finding graph partitions.
void	findPartitions(LayoutGraph graph, INodeMap partitionIDMap) Returns a partition ID for each node of an input graph.

Method Detail

createEdgeBetweennessPartitionFinder

static PartitionLayout.IPartitionFinder createEdgeBetweennessPartitionFinder()

Creates a PartitionLayout.IPartitionFinder that uses Groups.edgeBetweennessClustering(com.yworks.yfiles.algorithms.Graph, INodeMap, boolean, int, int, IDataProvider) as strategy for finding graph partitions.

createEdgeBetweennessPartitionFinder

static PartitionLayout.IPartitionFinder createEdgeBetweennessPartitionFinder(int minimumPartitionCount)

Creates a PartitionLayout.IPartitionFinder that uses Groups.edgeBetweennessClustering(com.yworks.yfiles.algorithms.Graph, INodeMap, boolean, int, int, IDataProvider) as strategy for finding graph partitions.

Parameters:

minimumPartitionCount - The minimum number of partitions the result should have.

createEdgeBetweennessPartitionFinder

static PartitionLayout.IPartitionFinder createEdgeBetweennessPartitionFinder(int minimumPartitionCount,
                                                                             int maximumPartitionCount)

Creates a PartitionLayout.IPartitionFinder that uses Groups.edgeBetweennessClustering(com.yworks.yfiles.algorithms.Graph, INodeMap, boolean, int, int, IDataProvider) as strategy for finding graph partitions.

Parameters:

minimumPartitionCount - The minimum number of partitions the result should have.

maximumPartitionCount - The maximum number of partitions the result should have.

findPartitions

void findPartitions(LayoutGraph graph,
                    INodeMap partitionIDMap)

Returns a partition ID for each node of an input graph.

Nodes that share a common partition ID are considered to belong to the same partition.

Parameters:

graph - the input graph

partitionIDMap - the map that is filled with the resulting partition IDs