Unit tests for the Max-Sum algorithm. More...

Inheritance diagram for frodo2.algorithms.maxsum.tests.MaxSumTests< V extends Addable< V >, U extends Addable >:

Public Member Functions
	MaxSumTests (boolean maximize, Class< U > classOfU, double p2, boolean useTCP, boolean acyclic, boolean randomInit, double perturb, boolean synchronous)
	Constructor.
void	test () throws Exception
	The test method.

Static Public Member Functions
static TestSuite	suite ()

Private Attributes
boolean	maximize
	Whether to maximize utility or minimize cost.
Class< U >	classOfU
	The class of U.
final double	p2
	The constraint tightness.
final boolean	useTCP
	Whether to use TCP pipes.
final boolean	acyclic
	Whether the graph should be acyclic.
final boolean	randomInit
	Whether to initialize the algorithm with random messages.
final double	maxPerturb
	The maximum amount of perturbation to add to each variable's unary constraint.
final boolean	synchronous
	Whether to run in synchronous mode.

Static Private Attributes
static final int	maxNbrVars = 20
	Maximum number of variables in the test problems.
static final int	maxNbrEdges = 190
	Maximum number of edges in the test constraint graphs.
static final int	maxNbrAgents = 20
	Maximum number of agents in the test problems.

Detailed Description

Unit tests for the Max-Sum algorithm.

Author: Thomas Leaute

Parameters

<V>	the type used for variable values
<U>	the type used for utility values

Constructor & Destructor Documentation

◆ MaxSumTests()

frodo2.algorithms.maxsum.tests.MaxSumTests< V extends Addable< V >, U extends Addable< U > >.MaxSumTests	(	boolean	maximize,
		Class< U >	classOfU,
		double	p2,
		boolean	useTCP,
		boolean	acyclic,
		boolean	randomInit,
		double	perturb,
		boolean	synchronous )

Constructor.

Parameters

maximize	Whether to maximize utility or minimize cost
classOfU	The class of U
p2	The constraint tightness
useTCP	Whether to use TCP pipes
acyclic	Whether the graph should be acyclic
randomInit	Whether to initialize the algorithm with random messages
perturb	The maximum amount of perturbation to add to each variable's unary constraint
synchronous	Whether to run in synchronous mode

References acyclic, classOfU, maximize, p2, randomInit, synchronous, and useTCP.

Referenced by suite().

Member Function Documentation

◆ suite()

TestSuite frodo2.algorithms.maxsum.tests.MaxSumTests< V extends Addable< V >, U extends Addable >.suite ( )

static

Returns: the suite of unit tests

Bug: Max-Sum may not terminate when using TCP pipes because there is not idleness detection

Bug: Max-Sum may not terminate when using TCP pipes because there is not idleness detection

References frodo2.algorithms.test.AllTests.DEFAULT_P2, MaxSumTests(), and suite().

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

Here is the call graph for this function:

◆ test()

void frodo2.algorithms.maxsum.tests.MaxSumTests< V extends Addable< V >, U extends Addable >.test ( ) throws Exception

The test method.

Exceptions

Exception if an error occurs

References frodo2.solutionSpaces.AddableInteger.abs(), acyclic, frodo2.algorithms.dpop.count.SolutionCounter< V extends Addable< V >, U extends Addable >.count(), frodo2.algorithms.test.AllTests.createRandProblem(), frodo2.solutionSpaces.AddableInteger.equals(), frodo2.algorithms.test.AllTests.generateProblem(), frodo2.algorithms.RandGraphFactory.getAcyclicGraph(), frodo2.algorithms.Solution< V, U >.getAssignments(), frodo2.solutionSpaces.AddableInteger.getPlusInfinity(), frodo2.algorithms.Solution< V, U >.getUtility(), frodo2.algorithms.XCSPparser< V extends Addable< V >, U extends Addable >.getUtility(), maximize, maxNbrAgents, maxNbrEdges, maxNbrVars, p2, frodo2.algorithms.XCSPparser< V extends Addable< V >, U extends Addable >.parse(), frodo2.algorithms.AbstractSolver, U extends Addable, S extends Solution< V, U >.setUtilClass(), frodo2.algorithms.XCSPparser< V extends Addable< V >, U extends Addable >.setUtilClass(), and frodo2.algorithms.AbstractDCOPsolver< V extends Addable< V >, U extends Addable, S extends Solution< V, U >.solve().

Here is the call graph for this function:

Member Data Documentation

◆ acyclic

final boolean frodo2.algorithms.maxsum.tests.MaxSumTests< V extends Addable< V >, U extends Addable >.acyclic

private

Whether the graph should be acyclic.

Referenced by MaxSumTests(), and test().

◆ classOfU

Class frodo2.algorithms.maxsum.tests.MaxSumTests< V extends Addable< V >, U extends Addable >.classOfU

private

The class of U.

Referenced by MaxSumTests().

◆ maximize

boolean frodo2.algorithms.maxsum.tests.MaxSumTests< V extends Addable< V >, U extends Addable >.maximize

private

Whether to maximize utility or minimize cost.

Referenced by MaxSumTests(), and test().

◆ maxNbrAgents

final int frodo2.algorithms.maxsum.tests.MaxSumTests< V extends Addable< V >, U extends Addable >.maxNbrAgents = 20

staticprivate

Maximum number of agents in the test problems.

Referenced by test().

◆ maxNbrEdges

final int frodo2.algorithms.maxsum.tests.MaxSumTests< V extends Addable< V >, U extends Addable >.maxNbrEdges = 190

staticprivate

Maximum number of edges in the test constraint graphs.

Referenced by test().

◆ maxNbrVars

final int frodo2.algorithms.maxsum.tests.MaxSumTests< V extends Addable< V >, U extends Addable >.maxNbrVars = 20

staticprivate

Maximum number of variables in the test problems.

Referenced by test().

◆ maxPerturb

final double frodo2.algorithms.maxsum.tests.MaxSumTests< V extends Addable< V >, U extends Addable >.maxPerturb

private

The maximum amount of perturbation to add to each variable's unary constraint.

◆ p2

final double frodo2.algorithms.maxsum.tests.MaxSumTests< V extends Addable< V >, U extends Addable >.p2

private

The constraint tightness.

Referenced by MaxSumTests(), and test().

◆ randomInit

final boolean frodo2.algorithms.maxsum.tests.MaxSumTests< V extends Addable< V >, U extends Addable >.randomInit

private

Whether to initialize the algorithm with random messages.

Referenced by MaxSumTests().

◆ synchronous

final boolean frodo2.algorithms.maxsum.tests.MaxSumTests< V extends Addable< V >, U extends Addable >.synchronous

private

Whether to run in synchronous mode.

Referenced by MaxSumTests().

◆ useTCP

final boolean frodo2.algorithms.maxsum.tests.MaxSumTests< V extends Addable< V >, U extends Addable >.useTCP

private

Whether to use TCP pipes.

Referenced by MaxSumTests().

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

src/frodo2/algorithms/maxsum/tests/MaxSumTests.java

Public Member Functions

Static Public Member Functions

Private Attributes

Static Private Attributes

Detailed Description

Constructor & Destructor Documentation

◆ MaxSumTests()

Member Function Documentation

◆ suite()

◆ test()

Member Data Documentation

◆ acyclic

◆ classOfU

◆ maximize

◆ maxNbrAgents

◆ maxNbrEdges

◆ maxNbrVars

◆ maxPerturb

◆ p2

◆ randomInit

◆ synchronous

◆ useTCP