org.linqs.psl.utils.graph.partition

Interface Partitioner

All Known Implementing Classes:

HierarchicalPartitioning, HyperPartitioning

public interface Partitioner

Method Summary

Modifier and Type	Method and Description
int	getSize() Returns the current size of produced partitions
List<List<Node>>	partition(Graph g, Iterable<? extends Node> nodes, RelationshipWeighter rweight) Partition the set of nodes into the specified number of blocks aiming to minimize the edge cut as specified by the RelationshipWeighter.
double	partition(Graph g, Iterable<? extends Node> nodes, RelationshipWeighter rweight, List<? extends Collection<Node>> partition) Partition the set of nodes into the specified number of blocks aiming to minimize the edge cut as specified by the RelationshipWeighter.
void	setSize(int size) Define the size of the partition, i.e.

Method Detail

setSize

void setSize(int size)

Define the size of the partition, i.e. the number of blocks to produce

Parameters:

size - Size of the partition

getSize

int getSize()

Returns the current size of produced partitions

Returns:

Size of partitions

partition

List<List<Node>> partition(Graph g,
                           Iterable<? extends Node> nodes,
                           RelationshipWeighter rweight)

Partition the set of nodes into the specified number of blocks aiming to minimize the edge cut as specified by the RelationshipWeighter. To specify that an edge should not be cut, its weight should be Double.POSITIVE_INFINITY. In such cases the method may produce an IllegalArgumentException if no partition could be found that satisfies the no-cut condition.

Parameters:

nodes - Iterable over a set of nodes. It is assumed, that no node occurs multiple times during iteration.

rweight - RelationshipWeighter defining the strength of relationships taken into account by the partitioning algorithm.

Returns:

A partition of the nodes

partition

double partition(Graph g,
                 Iterable<? extends Node> nodes,
                 RelationshipWeighter rweight,
                 List<? extends Collection<Node>> partition)

Partition the set of nodes into the specified number of blocks aiming to minimize the edge cut as specified by the RelationshipWeighter. Compared to the other partition(), this method expects that the user has initialized the container holding the partition, given the user more choice over what containers to use. Also, it returns the edge cut of the produced partition. To specify that an edge should not be cut, its weight should be Double.POSITIVE_INFINITY. In such cases the method may produce an IllegalArgumentException if no partition could be found that satisfies the no-cut condition.

Parameters:

nodes - Iterable over a set of nodes. It is assumed, that no node occurs multiple times during iteration.

rweight - RelationshipWeighter defining the strength of relationships taken into account by the partitioning algorithm.

partition - Initialized partition container

Returns:

The edge cut of the produced partition