public abstract class AbstractEquitablePartitionRefiner extends Object
Modifier and Type | Class and Description |
---|---|
static class |
AbstractEquitablePartitionRefiner.SplitOrder
A forward split order tends to favor partitions where the cells are
refined from lowest to highest.
|
Constructor and Description |
---|
AbstractEquitablePartitionRefiner() |
Modifier and Type | Method and Description |
---|---|
abstract int |
getVertexCount()
Gets from the graph the number of vertices.
|
abstract int |
neighboursInBlock(Set<Integer> block,
int vertexIndex)
Find |a ∩ b| - that is, the size of the intersection between a and b.
|
Partition |
refine(Partition coarser)
Refines the coarse partition
a into a finer one. |
void |
setSplitOrder(AbstractEquitablePartitionRefiner.SplitOrder splitOrder)
Set the preference for splitting cells.
|
public abstract int getVertexCount()
public abstract int neighboursInBlock(Set<Integer> block, int vertexIndex)
block
- a set of numbersvertexIndex
- the element to comparepublic void setSplitOrder(AbstractEquitablePartitionRefiner.SplitOrder splitOrder)
splitOrder
- either FORWARD or REVERSECopyright © 2014. All Rights Reserved.