cusack.hcg.graph.algorithm.util

Class OrderedKPartitionGenerator

java.lang.Object

cusack.hcg.graph.algorithm.util.OrderedKPartitionGenerator

public class OrderedKPartitionGenerator
extends java.lang.Object

This is a k-partition generator. However, this generates partitions where every element is at least one. For instance, n = 12 and k = 5 will NOT create the partition [12, 0, 0, 0, 0]. It will start with the partition [8, 1, 1, 1, 1]. It requires that k=n, the results are unpredictable. I believe this is the most efficient algorithm for what we want.

Author:

Aaron Green May 2015

Constructor Summary

Constructors

Constructor and Description
OrderedKPartitionGenerator(int n, int k)

Method Summary

Modifier and Type	Method and Description
boolean	hasNext()
int[]	next() Generates the next ordered k-partition.
void	reset()

Methods inherited from class java.lang.Object

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

Constructor Detail

OrderedKPartitionGenerator

public OrderedKPartitionGenerator(int n,
                                  int k)

Method Detail

reset

public void reset()

hasNext

public boolean hasNext()

next

public int[] next()

Generates the next ordered k-partition. Result is unpredictable if hasNext() is false.

Returns:

the next kPartition