public abstract class ExampleSet extends Object
Modifier and Type | Field and Description |
---|---|
IntVar |
cost
It specifies the cost function, null if no cost function is used.
|
Search<SetVar> |
search
It specifies the search procedure used by a given example.
|
Store |
store
It specifies the constraint store responsible for holding information
about constraints and variables.
|
List<SetVar> |
vars
It contains all variables used within a specific example.
|
Constructor and Description |
---|
ExampleSet() |
Modifier and Type | Method and Description |
---|---|
Search<SetVar> |
getSearch()
It returns the search used within an example.
|
List<SetVar> |
getSearchVariables()
It returns an array list of variables used to model the example.
|
Store |
getStore()
It specifies the constraint store used within an example.
|
abstract void |
model()
It specifies a standard way of modeling the problem.
|
static void |
printMatrix(IntVar[][] matrix,
int rows,
int cols)
It prints a matrix of variables.
|
boolean |
search()
It specifies simple search method based on input order and lexigraphical
ordering of values.
|
boolean |
searchAllAtOnce()
It specifies simple search method based on most constrained static and lexigraphical
ordering of values.
|
boolean |
searchAllOptimal()
It searches for all solutions with the optimal value.
|
boolean |
searchMasterSlave(List<Var> masterVars,
List<Var> slaveVars)
It conducts master-slave search.
|
boolean |
searchMostConstrainedStatic()
It specifies simple search method based variable order which
takes into account the number of constraints attached to a variable
and lexigraphical ordering of values.
|
boolean |
searchOptimal()
It specifies simple search method based on input order and lexigraphical
ordering of values.
|
boolean |
searchSmallestDomain(boolean optimal)
It specifies simple search method based on smallest domain variable order
and lexigraphical ordering of values.
|
boolean |
searchWeightedDegree()
It specifies simple search method based on weighted degree variable order
and lexigraphical ordering of values.
|
public IntVar cost
public Store store
public abstract void model()
public boolean search()
public boolean searchOptimal()
public boolean searchAllOptimal()
public boolean searchSmallestDomain(boolean optimal)
optimal
- it specifies if the search the optimal solution takes place.public boolean searchWeightedDegree()
public boolean searchMostConstrainedStatic()
public boolean searchAllAtOnce()
public boolean searchMasterSlave(List<Var> masterVars, List<Var> slaveVars)
masterVars
- it specifies the search variables used in master search.slaveVars
- it specifies the search variables used in slave search.public Search<SetVar> getSearch()
public Store getStore()
public List<SetVar> getSearchVariables()
public static void printMatrix(IntVar[][] matrix, int rows, int cols)
matrix
- matrix containing the grounded variables.rows
- number of elements in the first dimension.cols
- number of elements in the second dimension.Copyright © 2022. All rights reserved.