| Modifier and Type | Field and Description |
|---|---|
protected int[] |
fifo |
protected UndirectedGraph |
graph |
protected BitSet |
inMIS |
protected int |
n |
protected int[] |
nbNeighbours |
protected BitSet |
out |
| Constructor and Description |
|---|
MD(UndirectedGraph graph)
Creates an instance of the Min Degree heuristic to compute independent sets on graph
|
| Modifier and Type | Method and Description |
|---|---|
protected void |
addToMIS(int node) |
void |
computeMIS()
Computes an Independent Set as large as possible, although it is not necessarily maximum
|
BitSet |
getMIS() |
boolean |
hasNextMIS() |
void |
prepare()
Potentially performs some calculation before computing independent sets
|
protected UndirectedGraph graph
protected int n
protected BitSet out
protected BitSet inMIS
protected int[] nbNeighbours
protected int[] fifo
public MD(UndirectedGraph graph)
graph - the graphpublic void prepare()
Fpublic void computeMIS()
FcomputeMIS in interface Fprotected void addToMIS(int node)
public BitSet getMIS()
public boolean hasNextMIS()
hasNextMIS in interface FCopyright © 2017. All rights reserved.