frodo2.algorithms.dpop.count.test.TestCountSolutions Class Reference

Inheritance diagram for frodo2.algorithms.dpop.count.test.TestCountSolutions:

Public Member Functions
	TestCountSolutions (boolean maximize)
	Constructor.
void	testRandom ()
	Test the counter on a random problem.

Static Public Member Functions
static TestSuite	suite ()

Protected Member Functions
void	setUp () throws Exception
void	tearDown () throws Exception

Private Attributes
final int	maxNbrVars = 8
	Maximum number of variables in the problem.
final int	maxNbrEdges = 25
	Maximum number of binary constraints in the problem.
final int	maxNbrAgents = 8
	Maximum number of agents.
Graph	graph
	The constraint graph.
Document	problem
	A randomly generated problem.
final boolean	maximize
	Whether to maximize or minimize.

Detailed Description

Author

brammert

Constructor & Destructor Documentation

TestCountSolutions()

frodo2.algorithms.dpop.count.test.TestCountSolutions.TestCountSolutions

(

boolean

maximize

)

Constructor.

Parameters

maximize

Whether to maximize or minimize

References maximize.

Referenced by suite().

Member Function Documentation

setUp()

void frodo2.algorithms.dpop.count.test.TestCountSolutions.setUp ( ) throws Exception

protected

See also

junit.framework.TestCase#setUp()

References frodo2.algorithms.test.AllTests.generateProblem(), frodo2.algorithms.RandGraphFactory.getRandGraph(), graph, maxNbrAgents, maxNbrEdges, maxNbrVars, and problem.

Here is the call graph for this function:

suite()

TestSuite frodo2.algorithms.dpop.count.test.TestCountSolutions.suite ( )

static

Returns

the test suite

References suite(), and TestCountSolutions().

Referenced by suite(), and frodo2.algorithms.test.AllTests.suite().

Here is the call graph for this function:

tearDown()

void frodo2.algorithms.dpop.count.test.TestCountSolutions.tearDown ( ) throws Exception

protected

See also

junit.framework.TestCase#tearDown()

testRandom()

void frodo2.algorithms.dpop.count.test.TestCountSolutions.testRandom

(

)

Test the counter on a random problem.

References frodo2.algorithms.dpop.count.SolutionCounter< V extends Addable< V >, U extends Addable< U > >.count(), frodo2.solutionSpaces.AddableInteger.equals(), frodo2.algorithms.XCSPparser< V extends Addable< V >, U extends Addable< U > >.getDomainSize(), frodo2.algorithms.XCSPparser< V extends Addable< V >, U extends Addable< U > >.getMinInfUtility(), frodo2.algorithms.XCSPparser< V extends Addable< V >, U extends Addable< U > >.getPlusInfUtility(), frodo2.algorithms.XCSPparser< V extends Addable< V >, U extends Addable< U > >.getSolutionSpaces(), frodo2.algorithms.XCSPparser< V extends Addable< V >, U extends Addable< U > >.getVariables(), frodo2.solutionSpaces.SolutionSpace< V extends Addable< V > >.Iterator< V >.hasNext(), frodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable< U > >.iterator(), frodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable< U > >.join(), frodo2.solutionSpaces.BasicUtilitySolutionSpace< V extends Addable< V >, U extends Serializable >.SparseIterator< V, U >.nextUtility(), problem, and frodo2.algorithms.AbstractDCOPsolver< V extends Addable< V >, U extends Addable< U >, S extends Solution< V, U >.solve().

Here is the call graph for this function:

Member Data Documentation

graph

Graph frodo2.algorithms.dpop.count.test.TestCountSolutions.graph

private

The constraint graph.

Referenced by setUp().

maximize

final boolean frodo2.algorithms.dpop.count.test.TestCountSolutions.maximize

private

Whether to maximize or minimize.

Referenced by TestCountSolutions().

maxNbrAgents

final int frodo2.algorithms.dpop.count.test.TestCountSolutions.maxNbrAgents = 8

private

Maximum number of agents.

Referenced by setUp().

maxNbrEdges

final int frodo2.algorithms.dpop.count.test.TestCountSolutions.maxNbrEdges = 25

private

Maximum number of binary constraints in the problem.

Referenced by setUp().

maxNbrVars

final int frodo2.algorithms.dpop.count.test.TestCountSolutions.maxNbrVars = 8

private

Maximum number of variables in the problem.

Note

Must be at least 2.

Referenced by setUp().

problem

Document frodo2.algorithms.dpop.count.test.TestCountSolutions.problem

private

A randomly generated problem.

Referenced by setUp(), and testRandom().

---

The documentation for this class was generated from the following file:

• src/frodo2/algorithms/dpop/count/test/TestCountSolutions.java