A solver for a general problem. More...

Public Member Functions
void	setProblem (P problem)
	Sets the problem.
void	setFactory (AgentFactory< V, U > factory)
	Sets the agent factory.
void	setDomClass (Class< V > domClass)
	Sets the class for variable values.
void	setUtilClass (Class< U > utilClass)
	Sets the class for utility values.
Document	getAgentDesc ()
abstract List<? extends StatsReporter >	getSolGatherers ()
abstract S	buildSolution ()
S	solve (Document problem)
	Solves the input problem.
S	solve (P problem)
	Solves the input problem.
S	solve (Document problem, Long timeout)
	Solves the input problem.
S	solve (P problem, Long timeout)
	Solves the input problem.
S	solve (Document problem, boolean cleanAfterwards)
	Solves the input problem.
S	solve (P problem, boolean cleanAfterwards)
	Solves the input problem.
S	solve (Document problem, int nbrElectionRounds)
	Solves the input problem.
S	solve (P problem, int nbrElectionRounds)
	Solves the input problem.
S	solve (Document problem, int nbrElectionRounds, boolean measureMsgs)
	Solves the input problem.
S	solve (P problem, int nbrElectionRounds, boolean measureMsgs)
	Solves the input problem.
S	solve (Document problem, int nbrElectionRounds, boolean measureMsgs, Long timeout)
	Solves the input problem.
S	solve (P problem, int nbrElectionRounds, boolean measureMsgs, Long timeout)
	Solves the input problem.
S	solve (Document problem, int nbrElectionRounds, Long timeout)
	Solves the input problem.
S	solve (P problem, int nbrElectionRounds, Long timeout)
	Solves the input problem.
S	solve (Document problem, int nbrElectionRounds, boolean measureMsgs, Long timeout, boolean cleanAfterwards)
	Solves the input problem.
S	solve (P problem, int nbrElectionRounds, boolean measureMsgs, Long timeout, boolean cleanAfterwards)
	Solves the input problem.
S	solve (Document problem, boolean cleanAfterwards, Long timeout)
	Solves the input problem.
S	solve (P problem, boolean cleanAfterwards, Long timeout) throws OutOfMemoryError
	Solves the input problem.
String	plotStats (Solution< V, U > sol)
	Puts the statistics in a format that can easily be processed after the experiments.
String	plotDummyStats (boolean maximize)
	Used when the solver was not able to solve the problem.
boolean	timedOut ()
boolean	outOfMem ()

Protected Member Functions
	AbstractSolver ()
	Dummy constructor.
	AbstractSolver (String agentDescFile)
	Constructor from an agent configuration file.
	AbstractSolver (String agentDescFile, boolean useTCP)
	Constructor from an agent configuration file.
	AbstractSolver (Document agentDesc)
	Constructor.
	AbstractSolver (String agentDesc, boolean measureTime, boolean useTCP, boolean measureMsgs, Class<? extends XCSPparser< V, U > > parserClass, Class< V > assignmentClass, Class< U > valuationClass)
	Constructor from an agent configuration file.
	AbstractSolver (Document agentDesc, boolean useTCP)
	Constructor.
	AbstractSolver (Document agentDesc, Class< ? extends XCSPparser< V, U > > parserClass)
	Constructor.
	AbstractSolver (Document agentDesc, Class< ? extends XCSPparser< V, U > > parserClass, boolean useTCP)
	Constructor.
void	clear ()
	Clears the parser.

Protected Attributes
Document	agentDesc
	Description of the agent to be used.
AgentFactory< V, U >	factory
	The agent factory.
Class< ? extends XCSPparser< V, U > >	parserClass
	The class of the parser to be used.
List<? extends StatsReporter >	solGatherers
	The list of modules that record statistics about problem solving.
P	problem
	The problem.
final boolean	useTCP
	Whether to use TCP pipes or shared memory pipes.

Private Member Functions
void	setParserClass ()
	Sets the parser class as specified in the agent configuration file.

Private Attributes
boolean	timedOut
	`true` when the solver timed out, `false` otherwise
boolean	outOfMem
	`true` when the solver ran out of memory, `false` otherwise

Detailed Description

A solver for a general problem.

Author: Thomas Leaute

Parameters

<P>	type used for the problem
<V>	type used for variable values
<U>	type used for utility values
<S>	type used for the solution

Constructor & Destructor Documentation

◆ AbstractSolver() [1/8]

frodo2.algorithms.AbstractSolver, U extends Addable, S extends Solution< V, U >.AbstractSolver ( )

protected

Dummy constructor.

◆ AbstractSolver() [2/8]

frodo2.algorithms.AbstractSolver, U extends Addable, S extends Solution< V, U >.AbstractSolver ( String agentDescFile )

protected

Constructor from an agent configuration file.

Parameters

agentDescFile the agent configuration file

◆ AbstractSolver() [3/8]

frodo2.algorithms.AbstractSolver< P extends ProblemInterface< V, U, V extends Addable< V >, U extends Addable< U >, S extends Solution< V, U >.AbstractSolver	(	String	agentDescFile,
		boolean	useTCP )

protected

Constructor from an agent configuration file.

Parameters

agentDescFile	the agent configuration file
useTCP	Whether to use TCP pipes or shared memory pipes

Warning: Using TCP pipes automatically disables simulated time.

References frodo2.algorithms.XCSPparser< V extends Addable< V >, U extends Addable >.parse(), setParserClass(), and useTCP.

Here is the call graph for this function:

◆ AbstractSolver() [4/8]

frodo2.algorithms.AbstractSolver, U extends Addable, S extends Solution< V, U >.AbstractSolver ( Document agentDesc )

protected

Constructor.

Parameters

agentDesc a JDOM Document for the agent description

References agentDesc.

◆ AbstractSolver() [5/8]

frodo2.algorithms.AbstractSolver< P extends ProblemInterface< V, U, V extends Addable< V >, U extends Addable< U >, S extends Solution< V, U >.AbstractSolver	(	String	agentDesc,
		boolean	measureTime,
		boolean	useTCP,
		boolean	measureMsgs,
		Class<? extends XCSPparser< V, U > >	parserClass,
		Class< V >	assignmentClass,
		Class< U >	valuationClass )

protected

Constructor from an agent configuration file.

Parameters

agentDesc	the path to the agent description file
measureTime	whether to measure simulated time
useTCP	whether to use TCP pipes instead of shared memory (if true, disables the simulated time metric)
measureMsgs	whether to measure messages
parserClass	The class of the parser to be used
assignmentClass	the class of variable assignments
valuationClass	the class of valuations

References agentDesc, parserClass, and useTCP.

◆ AbstractSolver() [6/8]

frodo2.algorithms.AbstractSolver< P extends ProblemInterface< V, U, V extends Addable< V >, U extends Addable< U >, S extends Solution< V, U >.AbstractSolver	(	Document	agentDesc,
		boolean	useTCP )

protected

Constructor.

Parameters

agentDesc	a JDOM Document for the agent description
useTCP	Whether to use TCP pipes or shared memory pipes

Warning: Using TCP pipes automatically disables simulated time.

References agentDesc, setParserClass(), and useTCP.

Here is the call graph for this function:

◆ AbstractSolver() [7/8]

frodo2.algorithms.AbstractSolver< P extends ProblemInterface< V, U, V extends Addable< V >, U extends Addable< U >, S extends Solution< V, U >.AbstractSolver	(	Document	agentDesc,
		Class< ? extends XCSPparser< V, U > >	parserClass )

protected

Constructor.

Parameters

agentDesc	The agent description
parserClass	The class of the parser to be used

References agentDesc, and parserClass.

◆ AbstractSolver() [8/8]

frodo2.algorithms.AbstractSolver< P extends ProblemInterface< V, U, V extends Addable< V >, U extends Addable< U >, S extends Solution< V, U >.AbstractSolver	(	Document	agentDesc,
		Class< ? extends XCSPparser< V, U > >	parserClass,
		boolean	useTCP )

protected

Constructor.

Parameters

agentDesc	The agent description
parserClass	The class of the parser to be used
useTCP	Whether to use TCP pipes or shared memory pipes

Warning: Using TCP pipes automatically disables simulated time.

References agentDesc, parserClass, and useTCP.

Member Function Documentation

◆ buildSolution()

abstract S frodo2.algorithms.AbstractSolver, U extends Addable, S extends Solution< V, U >.buildSolution ( )

abstract

Returns: the solution as seen by the solution gatherers

Referenced by solve(), and frodo2.controller.userIO.DistributedSolver< V extends Addable< V >, U extends Addable, S extends Solution< V, U >.solve().

◆ clear()

void frodo2.algorithms.AbstractSolver, U extends Addable, S extends Solution< V, U >.clear ( )

protected

Clears the parser.

References factory.

Referenced by solve().

◆ getAgentDesc()

Document frodo2.algorithms.AbstractSolver, U extends Addable, S extends Solution< V, U >.getAgentDesc ( )

Returns: the agent description file

Referenced by frodo2.controller.userIO.DistributedSolver< V extends Addable< V >, U extends Addable, S extends Solution< V, U >.createTempFiles().

◆ getSolGatherers()

abstract List<? extends StatsReporter > frodo2.algorithms.AbstractSolver, U extends Addable, S extends Solution< V, U >.getSolGatherers ( )

abstract

Returns: The list of modules that record statistics about problem solving

Referenced by solve(), and frodo2.controller.userIO.DistributedSolver< V extends Addable< V >, U extends Addable, S extends Solution< V, U >.solve().

◆ outOfMem()

boolean frodo2.algorithms.AbstractSolver, U extends Addable, S extends Solution< V, U >.outOfMem ( )

Author: Brammert Ottens, 28 nov. 2011

Returns: true when the solver ran out of memory, false otherwise

◆ plotDummyStats()

String frodo2.algorithms.AbstractSolver, U extends Addable, S extends Solution< V, U >.plotDummyStats ( boolean maximize )

Used when the solver was not able to solve the problem.

Author: Brammert Ottens, Dec 29, 2011

Parameters

maximize true when maximizing, false otherwise

Returns: dummy stats

◆ plotStats()

String frodo2.algorithms.AbstractSolver, U extends Addable, S extends Solution< V, U >.plotStats ( Solution< V, U > sol )

Puts the statistics in a format that can easily be processed after the experiments.

Author: Brammert Ottens, Dec 29, 2011

Parameters

sol	the solution to be printed

Returns: string representation of the statistics

References frodo2.algorithms.Solution< V, U >.getNbrMsgs(), frodo2.algorithms.Solution< V, U >.getNcccCount(), frodo2.algorithms.Solution< V, U >.getTimeNeeded(), frodo2.algorithms.Solution< V, U >.getTotalMsgSize(), frodo2.algorithms.Solution< V, U >.getTreeWidth(), and frodo2.algorithms.Solution< V, U >.getUtility().

Here is the call graph for this function:

◆ setDomClass()

void frodo2.algorithms.AbstractSolver, U extends Addable, S extends Solution< V, U >.setDomClass ( Class< V > domClass )

Sets the class for variable values.

Parameters

domClass the class for variable values

◆ setFactory()

void frodo2.algorithms.AbstractSolver, U extends Addable, S extends Solution< V, U >.setFactory ( AgentFactory< V, U > factory )

Sets the agent factory.

Parameters

factory the agent factory

References factory.

Referenced by frodo2.controller.userIO.DistributedSolver< V extends Addable< V >, U extends Addable, S extends Solution< V, U >.DistributedSolver().

◆ setParserClass()

void frodo2.algorithms.AbstractSolver, U extends Addable, S extends Solution< V, U >.setParserClass ( )

private

Sets the parser class as specified in the agent configuration file.

References agentDesc, and setParserClass().

Referenced by AbstractSolver(), AbstractSolver(), and setParserClass().

Here is the call graph for this function:

◆ setProblem()

void frodo2.algorithms.AbstractSolver, U extends Addable, S extends Solution< V, U >.setProblem ( P problem )

Sets the problem.

Parameters

problem the problem

References problem.

Referenced by frodo2.controller.userIO.DistributedSolver< V extends Addable< V >, U extends Addable, S extends Solution< V, U >.solve().

◆ setUtilClass()

void frodo2.algorithms.AbstractSolver, U extends Addable, S extends Solution< V, U >.setUtilClass ( Class utilClass )

Sets the class for utility values.

Parameters

utilClass the class for utility values

Referenced by frodo2.algorithms.maxsum.tests.MaxSumTests< V extends Addable< V >, U extends Addable >.test(), and frodo2.solutionSpaces.vehiclerouting.test.VRPtests.test().

◆ solve() [1/18]

S frodo2.algorithms.AbstractSolver, U extends Addable, S extends Solution< V, U >.solve ( Document problem )

Solves the input problem.

Parameters

problem the problem

Returns: an optimal solution

References problem, and solve().

Referenced by solve(), solve(), solve(), solve(), solve(), solve(), solve(), solve(), solve(), solve(), solve(), solve(), solve(), solve(), solve(), solve(), and solve().

Here is the call graph for this function:

◆ solve() [2/18]

S frodo2.algorithms.AbstractSolver< P extends ProblemInterface< V, U, V extends Addable< V >, U extends Addable< U >, S extends Solution< V, U >.solve	(	Document	problem,
		boolean	cleanAfterwards )

Solves the input problem.

Parameters

problem	the problem
cleanAfterwards	if `true`, cleans all the agents and the queue when they're done

Returns: an optimal solution

References problem, and solve().

Here is the call graph for this function:

◆ solve() [3/18]

S frodo2.algorithms.AbstractSolver< P extends ProblemInterface< V, U, V extends Addable< V >, U extends Addable< U >, S extends Solution< V, U >.solve	(	Document	problem,
		boolean	cleanAfterwards,
		Long	timeout )

Solves the input problem.

Parameters

problem	the problem
cleanAfterwards	if `true`, cleans all the agents and the queue when they're done
timeout	timeout in ms, if `null`, no timeout is used

Returns: an optimal solution

References problem, solve(), and frodo2.timeout.

Here is the call graph for this function:

◆ solve() [4/18]

S frodo2.algorithms.AbstractSolver< P extends ProblemInterface< V, U, V extends Addable< V >, U extends Addable< U >, S extends Solution< V, U >.solve	(	Document	problem,
		int	nbrElectionRounds )

Solves the input problem.

Parameters

problem	the problem
nbrElectionRounds	the number of rounds of VariableElection (must be greater than the diameter of the constraint graph)

Returns: an optimal solution

References problem, and solve().

Here is the call graph for this function:

◆ solve() [5/18]

S frodo2.algorithms.AbstractSolver< P extends ProblemInterface< V, U, V extends Addable< V >, U extends Addable< U >, S extends Solution< V, U >.solve	(	Document	problem,
		int	nbrElectionRounds,
		boolean	measureMsgs )

Solves the input problem.

Parameters

problem	the problem
nbrElectionRounds	the number of rounds of VariableElection (must be greater than the diameter of the constraint graph)
measureMsgs	whether message sizes should be measured

Returns: an optimal solution

References problem, and solve().

Here is the call graph for this function:

◆ solve() [6/18]

S frodo2.algorithms.AbstractSolver< P extends ProblemInterface< V, U, V extends Addable< V >, U extends Addable< U >, S extends Solution< V, U >.solve	(	Document	problem,
		int	nbrElectionRounds,
		boolean	measureMsgs,
		Long	timeout )

Solves the input problem.

Parameters

problem	the problem
nbrElectionRounds	the number of rounds of VariableElection (must be greater than the diameter of the constraint graph)
measureMsgs	whether message sizes should be measured
timeout	timeout in ms, if `null`, no timeout is used

Returns: an optimal solution

References problem, solve(), and frodo2.timeout.

Here is the call graph for this function:

◆ solve() [7/18]

S frodo2.algorithms.AbstractSolver< P extends ProblemInterface< V, U, V extends Addable< V >, U extends Addable< U >, S extends Solution< V, U >.solve	(	Document	problem,
		int	nbrElectionRounds,
		boolean	measureMsgs,
		Long	timeout,
		boolean	cleanAfterwards )

Solves the input problem.

Parameters

problem	the problem
nbrElectionRounds	the number of rounds of VariableElection (must be greater than the diameter of the constraint graph)
measureMsgs	whether message sizes should be measured
timeout	timeout in ms, if `null`, no timeout is used
cleanAfterwards	if `true`, cleans all the agents and the queue when they're done

Returns: an optimal solution

References agentDesc, problem, solve(), and frodo2.timeout.

Here is the call graph for this function:

◆ solve() [8/18]

S frodo2.algorithms.AbstractSolver< P extends ProblemInterface< V, U, V extends Addable< V >, U extends Addable< U >, S extends Solution< V, U >.solve	(	Document	problem,
		int	nbrElectionRounds,
		Long	timeout )

Solves the input problem.

Parameters

problem	the problem
nbrElectionRounds	the number of rounds of VariableElection (must be greater than the diameter of the constraint graph)
timeout	timeout in ms, if `null`, no timeout is used

Returns: an optimal solution

References problem, solve(), and frodo2.timeout.

Here is the call graph for this function:

◆ solve() [9/18]

S frodo2.algorithms.AbstractSolver< P extends ProblemInterface< V, U, V extends Addable< V >, U extends Addable< U >, S extends Solution< V, U >.solve	(	Document	problem,
		Long	timeout )

Solves the input problem.

Parameters

problem	the problem
timeout	timeout in ms, if `null`, no timeout is used

Returns: an optimal solution

References problem, solve(), and frodo2.timeout.

Here is the call graph for this function:

◆ solve() [10/18]

S frodo2.algorithms.AbstractSolver, U extends Addable, S extends Solution< V, U >.solve ( P problem )

Solves the input problem.

Parameters

problem the problem

Returns: an optimal solution

References problem, and solve().

Here is the call graph for this function:

◆ solve() [11/18]

S frodo2.algorithms.AbstractSolver< P extends ProblemInterface< V, U, V extends Addable< V >, U extends Addable< U >, S extends Solution< V, U >.solve	(	P	problem,
		boolean	cleanAfterwards )

Solves the input problem.

Parameters

problem	the problem
cleanAfterwards	if `true`, cleans all the agents and the queue when they're done

Returns: an optimal solution

References problem, and solve().

Here is the call graph for this function:

◆ solve() [12/18]

S frodo2.algorithms.AbstractSolver< P extends ProblemInterface< V, U, V extends Addable< V >, U extends Addable< U >, S extends Solution< V, U >.solve	(	P	problem,
		boolean	cleanAfterwards,
		Long	timeout ) throws OutOfMemoryError

Solves the input problem.

Parameters

problem	the problem
cleanAfterwards	if `true`, cleans all the agents and the queue when they're done
timeout	timeout in ms, if `null`, no timeout is used

Returns: an optimal solution

Exceptions

OutOfMemoryError thrown when an out of memory exception is encountered in the agent factory

References agentDesc, buildSolution(), clear(), factory, getSolGatherers(), outOfMem, problem, frodo2.algorithms.AgentFactory< V extends Addable< V >, U extends Addable >.restart(), solGatherers, timedOut, and frodo2.timeout.

Here is the call graph for this function:

◆ solve() [13/18]

S frodo2.algorithms.AbstractSolver< P extends ProblemInterface< V, U, V extends Addable< V >, U extends Addable< U >, S extends Solution< V, U >.solve	(	P	problem,
		int	nbrElectionRounds )

Solves the input problem.

Parameters

problem	the problem
nbrElectionRounds	the number of rounds of VariableElection (must be greater than the diameter of the constraint graph)

Returns: an optimal solution

References problem, and solve().

Here is the call graph for this function:

◆ solve() [14/18]

S frodo2.algorithms.AbstractSolver< P extends ProblemInterface< V, U, V extends Addable< V >, U extends Addable< U >, S extends Solution< V, U >.solve	(	P	problem,
		int	nbrElectionRounds,
		boolean	measureMsgs )

Solves the input problem.

Parameters

problem	the problem
nbrElectionRounds	the number of rounds of VariableElection (must be greater than the diameter of the constraint graph)
measureMsgs	whether message sizes should be measured

Returns: an optimal solution

References problem, and solve().

Here is the call graph for this function:

◆ solve() [15/18]

S frodo2.algorithms.AbstractSolver< P extends ProblemInterface< V, U, V extends Addable< V >, U extends Addable< U >, S extends Solution< V, U >.solve	(	P	problem,
		int	nbrElectionRounds,
		boolean	measureMsgs,
		Long	timeout )

Solves the input problem.

Parameters

problem	the problem
nbrElectionRounds	the number of rounds of VariableElection (must be greater than the diameter of the constraint graph)
measureMsgs	whether message sizes should be measured
timeout	timeout in ms, if `null`, no timeout is used

Returns: an optimal solution

References problem, solve(), and frodo2.timeout.

Here is the call graph for this function:

◆ solve() [16/18]

S frodo2.algorithms.AbstractSolver< P extends ProblemInterface< V, U, V extends Addable< V >, U extends Addable< U >, S extends Solution< V, U >.solve	(	P	problem,
		int	nbrElectionRounds,
		boolean	measureMsgs,
		Long	timeout,
		boolean	cleanAfterwards )

Solves the input problem.

Parameters

problem	the problem
nbrElectionRounds	the number of rounds of VariableElection (must be greater than the diameter of the constraint graph)
measureMsgs	whether message sizes should be measured
timeout	timeout in ms, if `null`, no timeout is used
cleanAfterwards	if `true`, cleans all the agents and the queue when they're done

Returns: an optimal solution

References agentDesc, problem, solve(), and frodo2.timeout.

Here is the call graph for this function:

◆ solve() [17/18]

S frodo2.algorithms.AbstractSolver< P extends ProblemInterface< V, U, V extends Addable< V >, U extends Addable< U >, S extends Solution< V, U >.solve	(	P	problem,
		int	nbrElectionRounds,
		Long	timeout )

Solves the input problem.

Parameters

problem	the problem
nbrElectionRounds	the number of rounds of VariableElection (must be greater than the diameter of the constraint graph)
timeout	timeout in ms, if `null`, no timeout is used

Returns: an optimal solution

References problem, solve(), and frodo2.timeout.

Here is the call graph for this function:

◆ solve() [18/18]

S frodo2.algorithms.AbstractSolver< P extends ProblemInterface< V, U, V extends Addable< V >, U extends Addable< U >, S extends Solution< V, U >.solve	(	P	problem,
		Long	timeout )

Solves the input problem.

Parameters

problem	the problem
timeout	timeout in ms, if `null`, no timeout is used

Returns: an optimal solution

References problem, solve(), and frodo2.timeout.

Here is the call graph for this function:

◆ timedOut()

boolean frodo2.algorithms.AbstractSolver, U extends Addable, S extends Solution< V, U >.timedOut ( )

Author: Brammert Ottens, 28 nov. 2011

Returns: true when the solver timed out, false otherwise

Member Data Documentation

◆ agentDesc

Document frodo2.algorithms.AbstractSolver, U extends Addable, S extends Solution< V, U >.agentDesc

protected

Description of the agent to be used.

Referenced by AbstractSolver(), AbstractSolver(), AbstractSolver(), AbstractSolver(), AbstractSolver(), setParserClass(), solve(), solve(), and solve().

◆ factory

AgentFactory<V, U> frodo2.algorithms.AbstractSolver, U extends Addable, S extends Solution< V, U >.factory

protected

The agent factory.

Referenced by clear(), setFactory(), and solve().

◆ outOfMem

boolean frodo2.algorithms.AbstractSolver, U extends Addable, S extends Solution< V, U >.outOfMem

private

true when the solver ran out of memory, false otherwise

Referenced by solve().

◆ parserClass

Class< ? extends XCSPparser<V, U> > frodo2.algorithms.AbstractSolver, U extends Addable, S extends Solution< V, U >.parserClass

protected

The class of the parser to be used.

Referenced by AbstractSolver(), AbstractSolver(), and AbstractSolver().

◆ problem

P frodo2.algorithms.AbstractSolver, U extends Addable, S extends Solution< V, U >.problem

protected

The problem.

Referenced by setProblem(), solve(), solve(), solve(), solve(), solve(), solve(), solve(), solve(), solve(), solve(), solve(), solve(), solve(), solve(), solve(), solve(), solve(), and solve().

◆ solGatherers

List<? extends StatsReporter> frodo2.algorithms.AbstractSolver, U extends Addable, S extends Solution< V, U >.solGatherers

protected

The list of modules that record statistics about problem solving.

Bug: MAS solvers don't use the XCSPparser

Referenced by solve().

◆ timedOut

boolean frodo2.algorithms.AbstractSolver, U extends Addable, S extends Solution< V, U >.timedOut

private

true when the solver timed out, false otherwise

Referenced by solve().

◆ useTCP

final boolean frodo2.algorithms.AbstractSolver, U extends Addable, S extends Solution< V, U >.useTCP

protected

Whether to use TCP pipes or shared memory pipes.

Referenced by AbstractSolver(), AbstractSolver(), AbstractSolver(), and AbstractSolver().

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

src/frodo2/algorithms/AbstractSolver.java

Public Member Functions

Protected Member Functions

Protected Attributes

Private Member Functions

Private Attributes

Detailed Description

Constructor & Destructor Documentation

◆ AbstractSolver() [1/8]

◆ AbstractSolver() [2/8]

◆ AbstractSolver() [3/8]

◆ AbstractSolver() [4/8]

◆ AbstractSolver() [5/8]

◆ AbstractSolver() [6/8]

◆ AbstractSolver() [7/8]

◆ AbstractSolver() [8/8]

Member Function Documentation

◆ buildSolution()

◆ clear()

◆ getAgentDesc()

◆ getSolGatherers()

◆ outOfMem()

◆ plotDummyStats()

◆ plotStats()

◆ setDomClass()

◆ setFactory()

◆ setParserClass()

◆ setProblem()

◆ setUtilClass()

◆ solve() [1/18]

◆ solve() [2/18]

◆ solve() [3/18]

◆ solve() [4/18]

◆ solve() [5/18]

◆ solve() [6/18]

◆ solve() [7/18]

◆ solve() [8/18]

◆ solve() [9/18]

◆ solve() [10/18]

◆ solve() [11/18]

◆ solve() [12/18]

◆ solve() [13/18]

◆ solve() [14/18]

◆ solve() [15/18]

◆ solve() [16/18]

◆ solve() [17/18]

◆ solve() [18/18]

◆ timedOut()

Member Data Documentation

◆ agentDesc

◆ factory

◆ outOfMem

◆ parserClass

◆ problem

◆ solGatherers

◆ timedOut

◆ useTCP