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

Class HyperPartitioning

java.lang.Object

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

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

All Implemented Interfaces:

Partitioner

public class HyperPartitioning
extends HierarchicalPartitioning

Field Summary

Fields inherited from class org.linqs.psl.utils.graph.partition.hierarchical.HierarchicalPartitioning

relType, weightType

Constructor Summary

Constructors

Constructor and Description
HyperPartitioning()

Method Summary

Modifier and Type	Method and Description
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)

Methods inherited from class org.linqs.psl.utils.graph.partition.hierarchical.HierarchicalPartitioning

coarseSizeThreshold, createCoarseGraph, getBalanceExponent, getNoPartitioningTrials, getSize, partition, setBalanceExponent, setNoPartitioningTrials, setSize

Methods inherited from class java.lang.Object

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

Constructor Detail

HyperPartitioning

public HyperPartitioning()

Method Detail

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

Overrides:

partition in class HierarchicalPartitioning

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)

Overrides:

partition in class HierarchicalPartitioning