org.linqs.psl.utils.graph.partition.hierarchical

Class HierarchicalPartitioning

java.lang.Object

org.linqs.psl.utils.graph.partition.hierarchical.HierarchicalPartitioning

All Implemented Interfaces:

Partitioner

Direct Known Subclasses:

HyperPartitioning

public class HierarchicalPartitioning
extends Object
implements Partitioner

Field Summary

Fields

Modifier and Type	Field and Description
protected static String	relType
protected static String	weightType

Constructor Summary

Constructors

Constructor and Description
HierarchicalPartitioning()
HierarchicalPartitioning(int size)

Method Summary

Modifier and Type	Method and Description
static int	coarseSizeThreshold(int noPartitions)
protected static HashRelationshipWeighter	createCoarseGraph(Graph g, Iterable<org.linqs.psl.utils.graph.partition.hierarchical.SuperNode> supernodes, Map<Node,org.linqs.psl.utils.graph.partition.hierarchical.SuperNode> assign, RelationshipWeighter rweight)
double	getBalanceExponent()
int	getNoPartitioningTrials()
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.
double	partition(Graph g, Iterable<? extends Node> nodes, RelationshipWeighter rweight, NodeWeighter nweight, List<? extends Collection<Node>> partition)
void	setBalanceExponent(double balanceExponent)
void	setNoPartitioningTrials(int trials)
void	setSize(int size) Define the size of the partition, i.e.

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Field Detail

relType

protected static final String relType

See Also:

Constant Field Values

weightType

protected static final String weightType

See Also:

Constant Field Values

Constructor Detail

HierarchicalPartitioning

public HierarchicalPartitioning(int size)

HierarchicalPartitioning

public HierarchicalPartitioning()

Method Detail

setNoPartitioningTrials

public void setNoPartitioningTrials(int trials)

getNoPartitioningTrials

public int getNoPartitioningTrials()

getBalanceExponent

public double getBalanceExponent()

setBalanceExponent

public void setBalanceExponent(double balanceExponent)

coarseSizeThreshold

public static final int coarseSizeThreshold(int noPartitions)

getSize

public int getSize()

Description copied from interface: Partitioner

Returns the current size of produced partitions

Specified by:

getSize in interface Partitioner

Returns:

Size of partitions

setSize

public void setSize(int size)

Description copied from interface: Partitioner

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

Specified by:

setSize in interface Partitioner

Parameters:

size - Size of the partition

partition

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

Description copied from interface: Partitioner

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.

Specified by:

partition in interface Partitioner

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

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

Description copied from interface: Partitioner

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.

Specified by:

partition in interface Partitioner

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

partition

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

createCoarseGraph

protected static HashRelationshipWeighter createCoarseGraph(Graph g,
                                                            Iterable<org.linqs.psl.utils.graph.partition.hierarchical.SuperNode> supernodes,
                                                            Map<Node,org.linqs.psl.utils.graph.partition.hierarchical.SuperNode> assign,
                                                            RelationshipWeighter rweight)