|
FRODO Version 2.19.1
An open-source framework for Distributed Constraint Optimization (DCOP)
|
JUnit test for P_DPOP agent. More...

Public Member Functions | |
| P_DPOPagentTest (String method, boolean maximize, Class< V > domClass, boolean useTCP) | |
| Constructor. | |
| void | testP_DPOPvsDPOP () throws JDOMException, IOException |
| Test whenever P-DPOP's and DPOP's answers to a random problem are equivalent. | |
Static Public Member Functions | |
| static TestSuite | suite () |
Private Attributes | |
| int | maxVar = 5 |
| The maximum number of variables in this problem. | |
| int | maxAgent = 5 |
| The maximum number of agents in this problem. | |
| int | maxEdge = 10 |
| The maximum number of constraints in this problem. | |
| boolean | maximize |
| Whether to maximize or minimize. | |
| Class< V > | domClass |
| The class used for variable values. | |
| final boolean | useTCP |
| Whether to use TCP pipes. | |
JUnit test for P_DPOP agent.
| <V> | the type used for variable values |
| frodo2.algorithms.dpop.privacy.test.P_DPOPagentTest< V extends Addable< V > >.P_DPOPagentTest | ( | String | method, |
| boolean | maximize, | ||
| Class< V > | domClass, | ||
| boolean | useTCP ) |
Constructor.
| method | test method |
| maximize | Whether to maximize or minimize |
| domClass | the class to be used for variable values |
| useTCP | Whether to use TCP pipes |
References domClass, maximize, and useTCP.
Referenced by suite(), and testP_DPOPvsDPOP().
|
static |
References P_DPOPagentTest().
Referenced by frodo2.algorithms.dpop.privacy.test.AllTestsP_DPOP.suite().

| void frodo2.algorithms.dpop.privacy.test.P_DPOPagentTest< V extends Addable< V > >.testP_DPOPvsDPOP | ( | ) | throws JDOMException, IOException |
Test whenever P-DPOP's and DPOP's answers to a random problem are equivalent.
| IOException | is thrown if an I/O exception occur when accessing to the description of P-DPOP or DPOP algorithm |
| JDOMException | is thrown if a parsing error occurs |
References frodo2.algorithms.test.AllTests.createRandProblem(), frodo2.algorithms.XCSPparser< V extends Addable< V >, U extends Addable< U > >.getNbrVars(), frodo2.algorithms.Solution< V, U >.getReportedUtil(), frodo2.algorithms.Solution< V, U >.getUtility(), maxAgent, maxEdge, maxVar, P_DPOPagentTest(), frodo2.algorithms.XCSPparser< V extends Addable< V >, U extends Addable< U > >.parse(), frodo2.algorithms.XCSPparser< V extends Addable< V >, U extends Addable< U > >.setUtilClass(), and frodo2.algorithms.AbstractDCOPsolver< V extends Addable< V >, U extends Addable< U >, S extends Solution< V, U >.solve().

|
private |
The class used for variable values.
Referenced by P_DPOPagentTest().
|
private |
The maximum number of agents in this problem.
Referenced by testP_DPOPvsDPOP().
|
private |
The maximum number of constraints in this problem.
Referenced by testP_DPOPvsDPOP().
|
private |
Whether to maximize or minimize.
Referenced by P_DPOPagentTest().
|
private |
The maximum number of variables in this problem.
Referenced by testP_DPOPvsDPOP().
|
private |
Whether to use TCP pipes.
Referenced by P_DPOPagentTest().