Modifier and Type | Class and Description |
---|---|
class |
G
Backtrackable undirected graph
|
class |
Gci
Constrained intersection graph
|
class |
Gi
Intersection Graph
|
Modifier and Type | Field and Description |
---|---|
protected UndirectedGraph |
Rk.graph |
protected UndirectedGraph |
MD.graph |
Constructor and Description |
---|
MD(UndirectedGraph graph)
Creates an instance of the Min Degree heuristic to compute independent sets on graph
|
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
|
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
|
Modifier and Type | Method and Description |
---|---|
void |
R1.filter(IntVar[] vars,
UndirectedGraph graph,
F heur,
Propagator aCause) |
void |
R.filter(IntVar[] vars,
UndirectedGraph graph,
F heur,
Propagator aCause) |
void |
R4.filter(IntVar[] vars,
UndirectedGraph graph,
F heur,
Propagator aCause) |
void |
R3.filter(IntVar[] vars,
UndirectedGraph graph,
F heur,
Propagator aCause) |
void |
R2.filter(IntVar[] vars,
UndirectedGraph graph,
F heur,
Propagator aCause) |
Copyright © 2018. All rights reserved.