JUnit test for the class UTILpropagation. More...

Inheritance diagram for frodo2.algorithms.dpop.test.UTILpropagationTest >:

[legend]

Classes
class	Listener
	The listener that checks the messages sent by the UTILpropagation listeners. More...

Public Member Functions
	UTILpropagationTest (String method)
	Constructor that instantiates a test only for the input method.
	UTILpropagationTest (boolean useTCP, boolean useXML, Class< U > utilClass, boolean minNCCCs)
	Constructor.
void	testComputeDFS ()
	A test method that tests the test helper method computeDFS().
void	test () throws Exception
	Tests the UTIL propagation protocol on a random graph.

Static Public Member Functions
static TestSuite	suite ()
static< V extends Addable< V > U extends Addable< U > Map< String, DFSview< V, U > >	computeDFS (Graph graph, DCOPProblemInterface< V, U > problem)
static< V extends Addable< V > U extends Addable< U > Map< String, DFSview< V, U > >	computeDFS (Graph graph, DCOPProblemInterface< V, U > problem, boolean withSharedVars)
static< U extends Addable< U > Map< String, UtilitySolutionSpace< AddableInteger, U > >	startUTIL (RandGraphFactory.Graph graph, Map< String, DFSview< AddableInteger, U > > dfs, Map< String, Queue > queues, List< ? extends UtilitySolutionSpace< AddableInteger, U > > constraints)
	Sends messages to the queues to initiate the UTIL propagation.

Protected Member Functions
void	setUp ()
void	tearDown () throws Exception
	Ends all queues.
Listener	newListenerInstance (boolean useTCP, boolean useXML, Element parameters) throws Exception
	Creates a new Listener.

Protected Attributes
final int	maxNbrVars = 10
	Maximum number of variables in the random graph.
final int	maxNbrEdges = 40
	Maximum number of edges in the random graph.
final int	maxNbrAgents = 10
	Maximum number of agents.
RandGraphFactory.Graph	graph
	Random graph used to generate a constraint graph.
Map< String, DFSview< AddableInteger, U > >	dfs
	The DFS corresponding to the random graph.
Element	parameters
	The parameters for the module under test.
boolean	maximize
	Whether we should maximize or minimize.
int	sign = 0
	The desired sign for the utilities (if 0, utilities can be either sign).

Private Attributes
Map< String, Queue >	queues
	List of queues, indexed by agent name.
Map< String, String[] >	separators
	For each variable, the list of variables in its separator.
boolean	useTCP
	Whether to use TCP pipes or shared memory pipes.
boolean	useXML
	Whether to use the XML-based constructor.
Class< U >	utilClass
	The class to use for utility values.
boolean	minNCCCs
	Whether to optimize runtime or constraint checks.

Detailed Description

JUnit test for the class UTILpropagation.

Author: Thomas Leaute

Parameters

<U>	the type used for utility values

Constructor & Destructor Documentation

◆ UTILpropagationTest() [1/2]

frodo2.algorithms.dpop.test.UTILpropagationTest >.UTILpropagationTest ( String method )

Constructor that instantiates a test only for the input method.

Parameters

method test method

Referenced by suite().

◆ UTILpropagationTest() [2/2]

frodo2.algorithms.dpop.test.UTILpropagationTest< U extends Addable< U > >.UTILpropagationTest	(	boolean	useTCP,
		boolean	useXML,
		Class< U >	utilClass,
		boolean	minNCCCs )

Constructor.

Parameters

useTCP	whether to use TCP pipes or shared memory pipes
useXML	whether to use the XML-based constructor
utilClass	the class to use for utility values
minNCCCs	whether to optimize runtime or constraint checks

References maximize, minNCCCs, useTCP, useXML, and utilClass.

Member Function Documentation

◆ computeDFS() [1/2]

static< V extends Addable< V > U extends Addable< U > Map< String, DFSview< V, U > > frodo2.algorithms.dpop.test.UTILpropagationTest< U extends Addable< U > >.computeDFS	(	Graph	graph,
		DCOPProblemInterface< V, U >	problem )

static

References computeDFS(), and graph.

Here is the call graph for this function:

◆ computeDFS() [2/2]

static< V extends Addable< V > U extends Addable< U > Map< String, DFSview< V, U > > frodo2.algorithms.dpop.test.UTILpropagationTest< U extends Addable< U > >.computeDFS	(	Graph	graph,
		DCOPProblemInterface< V, U >	problem,
		boolean	withSharedVars )

static

Bug: the spaces must come for the agent's subproblem to correctly count NCCCs

Here is the call graph for this function:

◆ newListenerInstance()

Listener frodo2.algorithms.dpop.test.UTILpropagationTest< U extends Addable< U > >.newListenerInstance	(	boolean	useTCP,
		boolean	useXML,
		Element	parameters ) throws Exception

protected

Creates a new Listener.

Parameters

useTCP	`true` whether TCP pipes should be used instead of QueueIOPipes
useXML	whether we should use the constructor that takes in XML elements or the manual constructor
parameters	the parameters for the module under test

Returns: the new listener

Exceptions

Exception if an error occurs

Reimplemented in frodo2.algorithms.dpop.param.test.ParamUTILtest >, and frodo2.algorithms.dpop.stochastic.test.ExpectedUTILtest.

References parameters, useTCP, and useXML.

Referenced by test().

◆ setUp()

void frodo2.algorithms.dpop.test.UTILpropagationTest >.setUp ( )

protected

See also: junit.framework.TestCase#setUp()

Reimplemented in frodo2.algorithms.dpop.param.test.ParamUTILtest >, and frodo2.algorithms.dpop.stochastic.test.ExpectedUTILtest.

References frodo2.algorithms.RandGraphFactory.getRandGraph(), graph, maxNbrAgents, maxNbrEdges, maxNbrVars, minNCCCs, parameters, and useXML.

Here is the call graph for this function:

◆ startUTIL()

static< U extends Addable< U > Map< String, UtilitySolutionSpace< AddableInteger, U > > frodo2.algorithms.dpop.test.UTILpropagationTest< U extends Addable< U > >.startUTIL	(	RandGraphFactory.Graph	graph,
		Map< String, DFSview< AddableInteger, U > >	dfs,
		Map< String, Queue >	queues,
		List< ? extends UtilitySolutionSpace< AddableInteger, U > >	constraints )

static

Sends messages to the queues to initiate the UTIL propagation.

Parameters

<U>	the type used for utility values
graph	the constraint graph
dfs	the corresponding DFS (for each node in the graph, the relationships of this node)
queues	the array of queues, indexed by the names of the clusters in the graph
constraints	the hypercubes in the problem definition