frodo2.algorithms.dpop.param.ParamDPOPsolver< V extends Addable< V >, U extends Addable< U > >.ParamSolution< V extends Addable< V >, U extends Addable< U > > Class Template Reference

An optimal solution to the problem. More...

Public Member Functions
	ParamSolution (UtilitySolutionSpace< V, U > utility, Map< String[], BasicUtilitySolutionSpace< V, ArrayList< V > > > assignments, long ncccCount, long timeNeeded, int treeWidth)
	Constructor.
UtilitySolutionSpace< V, U >	getUtility ()
Map< String[], BasicUtilitySolutionSpace< V, ArrayList< V > > >	getAssignments ()
long	getNcccCount ()
long	getTimeNeeded ()
int	getTreeWidth ()
String	toString ()

Private Attributes
UtilitySolutionSpace< V, U >	utility
	Utility of the solution, as a function of the parameters.
Map< String[], BasicUtilitySolutionSpace< V, ArrayList< V > > >	assignments
	For arrays of variables, their assignments in the solution found to the problem, as a function of the parameters.
long	ncccCount
	The number of ncccs used.
long	timeNeeded
	The time needed to solve the problem.
int	treeWidth = -1
	The tree width of the tree on which the algorithm has run.

Detailed Description

An optimal solution to the problem.

Parameters

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

Constructor & Destructor Documentation

ParamSolution()

frodo2.algorithms.dpop.param.ParamDPOPsolver< V extends Addable< V >, U extends Addable< U > >.ParamSolution< V extends Addable< V >, U extends Addable< U > >.ParamSolution	(	UtilitySolutionSpace< V, U >	utility,
		Map< String[], BasicUtilitySolutionSpace< V, ArrayList< V > > >	assignments,
		long	ncccCount,
		long	timeNeeded,
		int	treeWidth )

Constructor.

Parameters

utility	the optimal utility, as a function of the parameters
assignments	the optimal assignments, as a function of the parameters
ncccCount	the ncccs used
timeNeeded	the time needed to solve the problem
treeWidth	the width of the tree on which the algorithm has run

References assignments, ncccCount, timeNeeded, treeWidth, and utility.

Member Function Documentation

getAssignments()

Map< String[], BasicUtilitySolutionSpace< V, ArrayList< V > > > frodo2.algorithms.dpop.param.ParamDPOPsolver< V extends Addable< V >, U extends Addable< U > >.ParamSolution< V extends Addable< V >, U extends Addable< U > >.getAssignments

(

)

Returns

the optimal assignments found, as a function of the parameters

References assignments.

getNcccCount()

long frodo2.algorithms.dpop.param.ParamDPOPsolver< V extends Addable< V >, U extends Addable< U > >.ParamSolution< V extends Addable< V >, U extends Addable< U > >.getNcccCount

(

)

Returns

the ncccCount

References ncccCount.

getTimeNeeded()

long frodo2.algorithms.dpop.param.ParamDPOPsolver< V extends Addable< V >, U extends Addable< U > >.ParamSolution< V extends Addable< V >, U extends Addable< U > >.getTimeNeeded

(

)

Author

Brammert Ottens, 22 jun 2009

Returns

the time needed to solve the problem

getTreeWidth()

int frodo2.algorithms.dpop.param.ParamDPOPsolver< V extends Addable< V >, U extends Addable< U > >.ParamSolution< V extends Addable< V >, U extends Addable< U > >.getTreeWidth

(

)

Returns

the tree width of the tree on which the algorithm ran

getUtility()

UtilitySolutionSpace< V, U > frodo2.algorithms.dpop.param.ParamDPOPsolver< V extends Addable< V >, U extends Addable< U > >.ParamSolution< V extends Addable< V >, U extends Addable< U > >.getUtility

(

)

Returns

the utility of the solution, as a function of the parameters

References utility.

toString()

String frodo2.algorithms.dpop.param.ParamDPOPsolver< V extends Addable< V >, U extends Addable< U > >.ParamSolution< V extends Addable< V >, U extends Addable< U > >.toString

(

)

See also

java.lang.Object#toString()

Member Data Documentation

assignments

Map< String[], BasicUtilitySolutionSpace< V, ArrayList<V> > > frodo2.algorithms.dpop.param.ParamDPOPsolver< V extends Addable< V >, U extends Addable< U > >.ParamSolution< V extends Addable< V >, U extends Addable< U > >.assignments

private

For arrays of variables, their assignments in the solution found to the problem, as a function of the parameters.

Referenced by getAssignments(), and ParamSolution().

ncccCount

long frodo2.algorithms.dpop.param.ParamDPOPsolver< V extends Addable< V >, U extends Addable< U > >.ParamSolution< V extends Addable< V >, U extends Addable< U > >.ncccCount

private

The number of ncccs used.

Referenced by getNcccCount(), and ParamSolution().

timeNeeded

long frodo2.algorithms.dpop.param.ParamDPOPsolver< V extends Addable< V >, U extends Addable< U > >.ParamSolution< V extends Addable< V >, U extends Addable< U > >.timeNeeded

private

The time needed to solve the problem.

Referenced by ParamSolution().

treeWidth

int frodo2.algorithms.dpop.param.ParamDPOPsolver< V extends Addable< V >, U extends Addable< U > >.ParamSolution< V extends Addable< V >, U extends Addable< U > >.treeWidth = -1

private

The tree width of the tree on which the algorithm has run.

Referenced by ParamSolution().

utility

UtilitySolutionSpace<V, U> frodo2.algorithms.dpop.param.ParamDPOPsolver< V extends Addable< V >, U extends Addable< U > >.ParamSolution< V extends Addable< V >, U extends Addable< U > >.utility

private

Utility of the solution, as a function of the parameters.

Referenced by getUtility(), and ParamSolution().

---

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

• src/frodo2/algorithms/dpop/param/ParamDPOPsolver.java