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

Class MDRk

java.lang.Object

org.chocosolver.solver.constraints.nary.nvalue.amnv.mis.MD

org.chocosolver.solver.constraints.nary.nvalue.amnv.mis.MDRk

All Implemented Interfaces:

F

public class MDRk
extends MD

Min Degree + Random k heuristic

Since:

01/01/2014

Author:

Jean-Guillaume Fages

Field Summary

Fields

Modifier and Type	Field and Description
protected int	iter
protected int	k
protected Random	rd

Fields inherited from class org.chocosolver.solver.constraints.nary.nvalue.amnv.mis.MD

fifo, graph, inMIS, n, nbNeighbours, out

Constructor Summary

Constructors

Constructor and Description
MDRk(UndirectedGraph graph) Creates an instance of the Min Degree + Random k heuristic to compute independent sets on graph
MDRk(UndirectedGraph graph, int k) Creates an instance of the Min Degree + Random k heuristic to compute independent sets on graph

Method Summary

Modifier and Type	Method and Description
void	computeMIS() Computes an Independent Set as large as possible, although it is not necessarily maximum
protected void	computeMISRk()
boolean	hasNextMIS()
void	prepare() Potentially performs some calculation before computing independent sets

Methods inherited from class org.chocosolver.solver.constraints.nary.nvalue.amnv.mis.MD

addToMIS, getMIS

Methods inherited from class java.lang.Object

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

Field Detail

k

protected int k

iter

protected int iter

rd

protected Random rd

Constructor Detail

MDRk

public MDRk(UndirectedGraph graph,
            int k)

Creates an instance of the Min Degree + Random k heuristic to compute independent sets on graph

Parameters:

graph - the grah

k - number of random iterations

MDRk

public MDRk(UndirectedGraph graph)

Creates an instance of the Min Degree + Random k heuristic to compute independent sets on graph

Parameters:

graph - the graph

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

Overrides:

prepare in class MD

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

Overrides:

computeMIS in class MD

computeMISRk

protected void computeMISRk()

hasNextMIS

public boolean hasNextMIS()

Specified by:

hasNextMIS in interface F

Overrides:

hasNextMIS in class MD

Returns:

true iff the heuristic can compute another independent set