| Modifier and Type | Field and Description |
|---|---|
protected int |
iter |
protected int |
k |
protected Random |
rd |
| 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
|
| 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
|
protected int k
protected int iter
protected Random rd
public MDRk(UndirectedGraph graph, int k)
graph - the grahk - number of random iterationspublic MDRk(UndirectedGraph graph)
graph - the graphpublic void prepare()
Fpublic void computeMIS()
FcomputeMIS in interface FcomputeMIS in class MDprotected void computeMISRk()
public boolean hasNextMIS()
hasNextMIS in interface FhasNextMIS in class MDCopyright © 2018. All rights reserved.