org.chocosolver.solver.constraints.nary.nValue.amnv.mis

Class Rk

java.lang.Object

org.chocosolver.solver.constraints.nary.nValue.amnv.mis.Rk

All Implemented Interfaces:

F

public class Rk
extends Object
implements F

Random heuristic

Since:

01/01/2014

Author:

Jean-Guillaume Fages

Field Summary

Fields

Modifier and Type	Field and Description
static int	DEFAULT_K
protected UndirectedGraph	graph
protected BitSet	inMIS
protected int	iter
protected int	k
protected int	n
protected BitSet	out
protected Random	rd

Constructor Summary

Constructors

Constructor and Description
Rk(UndirectedGraph graph) Creates an instance of the Random heuristic to compute independent sets on graph uses the default setting DEFAULT_K=30
Rk(UndirectedGraph graph, int k) Creates an instance of the Random heuristic to compute independent sets on graph

Method Summary

Methods

Modifier and Type	Method and Description
void	computeMIS() Computes an Independent Set as large as possible, although it is not necessarily maximum
void	duplicate(Solver solver, gnu.trove.map.hash.THashMap<Object,Object> identitymap)
BitSet	getMIS()
boolean	hasNextMIS()
void	prepare() Potentially performs some calculation before computing independent sets

Methods inherited from class java.lang.Object

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

Field Detail

DEFAULT_K

public static int DEFAULT_K

graph

protected UndirectedGraph graph

n

protected int n

k

protected int k

iter

protected int iter

out

protected BitSet out

inMIS

protected BitSet inMIS

rd

protected Random rd

Constructor Detail

Rk

public Rk(UndirectedGraph graph,
  int k)

Creates an instance of the Random heuristic to compute independent sets on graph

Parameters:

graph - on which IS have to be computed

k - number of iterations (i.e. number of expected IS per propagation)

Rk

public Rk(UndirectedGraph graph)

Creates an instance of the Random heuristic to compute independent sets on graph uses the default setting DEFAULT_K=30

Parameters:

graph - on which IS have to be computed

Method Detail

prepare

public void prepare()

Description copied from interface: F

Potentially performs some calculation before computing independent sets

Specified by:

prepare in interface F

computeMIS

public void computeMIS()

Description copied from interface: F

Computes an Independent Set as large as possible, although it is not necessarily maximum

Specified by:

computeMIS in interface F

getMIS

public BitSet getMIS()

Specified by:

getMIS in interface F

Returns:

a BitSet representing vertices that belong to the independent set

hasNextMIS

public boolean hasNextMIS()

Specified by:

hasNextMIS in interface F

Returns:

true iff the heuristic can compute another independent set

duplicate

public void duplicate(Solver solver,
             gnu.trove.map.hash.THashMap<Object,Object> identitymap)

Specified by:

duplicate in interface F