This class is designed to store GOODs received by a node from its children, and is used in the O-DPOP algorithm. More...

Inheritance diagram for frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable, L extends LeafNode >:

[legend]

Classes
class	IntArrayWrapper
	The IntArrayWrapper is used as a key for (partial) assignments. More...

Public Member Functions
	InnerNodeTree (String ownVariable, Val[] ownVariableDomain, List< UtilitySolutionSpace< Val, U > > spaces, U zero, int numberOfChildren, U infeasibleUtil, boolean maximize, boolean collectStats)
	A constructor.
	InnerNodeTree (String ownVariable, Val[] ownVariableDomain, UtilitySolutionSpace< Val, U > space, int numberOfChildren, U zero, L leafNodeInstance, U infeasibleUtil, boolean maximize, boolean collectStats)
	A constructor.
	InnerNodeTree (String ownVariable, Val[] ownVariableDomain, List< UtilitySolutionSpace< Val, U > > spaces, int numberOfChildren, U zero, L leafNodeInstance, U infeasibleUtil, boolean maximize, boolean collectStats)
	A constructor.
boolean	add (Good< Val, U > g, int sender, HashMap< String, Val[]> domains)
	Adds a good to the tree.
Good< Val, U >	getAmax ()
void	getBestAssignmentForOwnVariable (HashMap< String, Val > contextMap)
String[]	getChildSeparatorReportingOrder (int child)
	Returns the variables in the childs separator in the order it reported them.
int	getChildSeparatorSize (int child)
HashMap< String, Val >	getChildValues (HashMap< String, Val > parentContext, int child)
	Given a map that maps variables to values, this method returns the values belonging to the variables in a child's separator.
int[]	getFinalDomainSize ()
Val[][]	getDomains ()
boolean	hasFullInfo ()
boolean	hasMore ()
boolean	isValuationSufficient ()
boolean	knowsVariable (String variable)
boolean	notEnoughInfo ()
void	removeAMax ()
void	setChildrenSeparator (int child, String[] variables)
	Initializes the separator of a child.
boolean	stillToSend ()
boolean	setChildDone (int child)
	If a child has send a DONE message, the upper bound should be set to -infinity.
String	toString ()
	Method used for debugging purposes.
IntArrayWrapper	createIntArrayWrapper (int[] array)
IntArrayWrapper	createIntArrayWrapper (int size)
boolean	checkLeaf (L leaf, IntArrayWrapper currentPath, boolean checkUB, U utility, int sender)
	Method to check that the utility and UB are consistent with the available information.
boolean	compareWithHypercube (UtilitySolutionSpace< Val, U > h)
	Method to check the initialization of the tree.
boolean	pathExists (Val[] values)
boolean	UBexists (InnerNode< U, L > currentNode, int depth)
	Test to see whether a leafnode used as upperbound actually exists, i.e.
boolean	Utilexists (InnerNode< U, L > currentNode, int depth)
	Checks whether the maxUtil of a node actually exists.
int	treeSize ()
	Wrapper around treeSize(int, int, Node).
void	setFinalDomainSize (String[] variables, int[] domainSize)
Public Member Functions inherited from frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable< U >, L extends Node< U > >
	GoodsTree (String ownVariable, Val[] ownVariableDomain, UtilitySolutionSpace< Val, U > space, U zero, int numberOfChildren, U infeasibleUtil, boolean maximize, boolean collectStats)
	A constructor.
	GoodsTree (String ownVariable, Val[] ownVariableDomain, List< UtilitySolutionSpace< Val, U > > spaces, U zero, int numberOfChildren, U infeasibleUtil, boolean maximize, boolean collectStats)
	A constructor.
double	getTreeFillPercentage ()
long	getNumberOfDummies ()
double	getDummiesFillPercentage ()
boolean	greaterThanOrEqual (U u1, U u2)
	Compares two values.
boolean	greaterThan (U u1, U u2)
	Compares two values.
U	getMaximalCut ()
long	getNumberOfGoodsSent ()
long	getSizeOfSpace ()

Protected Member Functions
	InnerNodeTree (String ownVariable, Val[] ownVariableDomain, UtilitySolutionSpace< Val, U > space, U zero, int numberOfChildren, U infeasibleUtil, boolean maximize, boolean collectStats)
	A constructor.
	InnerNodeTree (L leafNodeInstance, String ownVariable, Val[] ownVariableDomain, UtilitySolutionSpace< Val, U > space, U zero, int numberOfChildren, U infeasibleUtil, boolean maximize, boolean collectStats)
	A dummy constructor to be used by extending classes.
	InnerNodeTree (L leafNodeInstance, String ownVariable, Val[] ownVariableDomain, List< UtilitySolutionSpace< Val, U > > spaces, U zero, int numberOfChildren, U infeasibleUtil, boolean maximize, boolean collectStats)
	A dummy constructor to be used by extending classes.
int[]	addNewVariable (String[] allVariables, HashMap< String, Val > newVariables, HashMap< String, Val[]> newDomains, int sender)
	This method adds new variables to the data structure.
boolean	addVariableToTree (int nbrNewVariables, IntArrayWrapper currentPath, int[] indexPath, int depth, InnerNode< U, L > oldRoot, InnerNode< U, L > currentNode, boolean possibleInconsistencies, boolean onIndexPath, int sender)
	This method is called when variables are received.
InnerNode< U, L >	createInnerNode (int numberOfChildren)
	Create an inner node with a specified number of children.
InnerNode< U, L >	createInnerNode (Node< U >[] children)
	Create an inner node with the specified number of children.
L	createLeaf (IntArrayWrapper currentPath, Good< Val, U > g, int child, final boolean withUB)
	Method to create a new leaf node.
L	createLeaf (IntArrayWrapper currentPath, final boolean withUB)
	Method to create a new leaf node.
InnerNode< U, L >	createPathNoUB (int depth, IntArrayWrapper currentPath, int[] partialPath, boolean real, Good< Val, U > g, int sender)
	Given a partial path, this method creates the path in the tree.
void	finalDomainSizeReceiver ()
	logs the reception of a domain size info message
int[]	getOwnVariableOptions (Val[] assignments)
	Given the assignment of variables in its separator, this method returns the utility for all domain elements of the own variable.
U	getOwnVariableOptions (int[] path, int[] optimalPath, U maxUtil, int depth, InnerNode< U, L > currentNode)
	Given a possibly partial path, this method finds the maximal utility any option can provide.
U	getUtilityLocalProblem (IntArrayWrapper currentPath)
	Given an assignment to all the variables, represented as a path in the tree, this method returns the utility given by the variable's local problem.
void	init (int numberOfChildren, U zero)
	Initialize all the variables of the tree.
void	initializeUpperBoundSums ()
	Initializes both the sum of bounds array and the powersOf2 array.
U	initiateBounds (InnerNode< U, L > currentNode, IntArrayWrapper currentPath, int depth, boolean onLocalPath, Good< Val, U > g, int sender)
	This method instantiates the upper bounds.
boolean	localPathAlive (int depth, InnerNode< U, L > currentNode)
	Used to check whether the local path chosen is still alive For debuggin purposes only.
boolean	pathAlive (int[] path, int depth, InnerNode< U, L > currentNode)
	Method to check whether the (possibly) partial path is alive, i.e.
void	updatePath (int depth, IntArrayWrapper currentPath, int[] partialPath, InnerNode< U, L > currentNode, Good< Val, U > g, U utilityDelta, int sender, boolean onLocalPath, final boolean withUB)
	This method walks trough the tree according to the given partial path and finds all leaf nodes that correspond to assignments that are compatible with the good to be added.
void	updateLocalProblem ()
void	updateUpperBoundSums (int child, U oldBound, U newBound)
	Updates the upperBoundSums array given the child that has changed its bound, the old bound and the new bound.
boolean	upperBoundChangesUtil (InnerNode< U, L > node, U UB)
U	recalculateUB (int depth, InnerNode< U, L > currentNodeUncast, U UBtoBeat, boolean recalculateUtil, boolean recalculateUB)
	This method recalculates the upper bound for a particular node.
void	removeInconsistencies (InnerNode< U, L > currentNode, int depth, IntArrayWrapper currentPath)
	This method checks whether any of the leafnodes have become infeasible due to the addition of a new variable.
boolean	removePath (int depth, InnerNode< U, L > currentNode, boolean onLocalPath)
	This method finds the leaf node corresponding to the current best assignment, removes all its children and sets its parent node to a dead node.
IntArrayWrapper	toKey (Val[] values, String[] variables, int sender)
	Takes a good received by a child and transforms the assignment to a key.
boolean	checkTree (int depth, InnerNode< U, L > currentNode, IntArrayWrapper currentPath, boolean UB, boolean checkLeafs, boolean checkSupport, boolean checkUtil)
	This method checks the tree on the following properties.
boolean	hasSupport (IntArrayWrapper currentPath)
	Method to check whether a particular leaf node has support, i.e.
boolean	setOldUB ()
	Used to set the old upperbound.
Protected Member Functions inherited from frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable< U >, L extends Node< U > >
void	solveLocalProblem ()
	Method used to solve the local problem and create an ordered list of all feasible assignments.
void	countLeafNode ()
	Method used to count the number of leaf nodes created (includes the dummy nodes).
void	countLeafNode (boolean real)
	Method used to count the number of leaf nodes created (includes the dummy nodes).
void	countGoodsProduced ()
	Count rhe number of goods produced.

Protected Attributes
HashMap< String, Integer >	variableToDepth
	links a variable to its depth in the tree.
HashMap< String, HashMap< Val, Integer > >	valuePointers
	Used to determine to which child a variable value corresponds to.
int[]	domainSize
	Stores, for a level in the tree, the size of the domain of the corresponding variable.
int[]	finalDomainSize
	Stores the final sizes of the domains of all the variables.
int[]	branchingFactor
	For every level of the tree, it stores the branching factor.
boolean[][]	childrenVariables
	Stores which variables are in a child's separator.
String[][]	childrenVariablesReportingOrder
	For each child it stores the order in which the variables are reported.
int[]	separatorSizePerChild
	Stores the number of reported variables per child.
boolean[]	ownVariables
	Stores which are this variable's neighbours.
ArrayList< HashMap< IntArrayWrapper, U > >	goodsReceived
	For each child a map that stores the utilities received from children.
boolean	storeReceivedGoods = true
	If domain or variable information is incomplete received goods must be stored, otherwise they can be discarded after processing.
boolean	hasLocalProblem
	`true` when this variable has a local problem, and false otherwise
U	optimalLocalUtility
	The optimal utility of the local problem.
int[]	optimalLocalPath
	The path of the currently optimal local solution.
U	localUpperBound
	The upperbound on all the completely unseen assignments.
U[]	upperBounds
	For each child it stores that last confirmed utility received.
U[]	upperBoundSums
	For every combination of children, this array contains the sum of upperBounds belonging to the selected children.
int	maxNumberLocalProblemOccurences
	The total number of times a solution to a local problem can be used in the separator problem.
int[]	powersOf2
	Pre-calculated powers of 2.
int	upperBoundIsInfiniteCounter
	Counts the number of children that have already sent at least one confirmed good.
int	upperBoundIsMinInfiniteCounter
	COunts the number of children that have already reported a minInfinite value.
HashMap< String, ArrayList< Val > >	domains
	The variable domains, where the position in the ArrayList denotes which child corresponds to the value.
int	numberOfChildren
	The number of children of the variable.
InnerNode< U, L >	root
	The root of the tree.
boolean	fullInfo
	True when the information on the final domain size is complete.
int	fullInfoCounter
	Counts the number of children from which one still needs to receive domain information.
boolean	stillToSend = true
	True if the domain information has not been requested yet.
L	leafNodeInstance
	An instance of a leaf node, used to create new instances.
U	oldUB
	Stores the UB as it was before a new good has been received.
int	localCounter
	The number of times the currently best local solution has NOT been used in the tree, i.e.
String[][]	unpackedVariablesPerChild
	Per child the unpacked variables (different from the reported variables).
HashMap< String, Val[]>	toBeProcessedDomains
	Domains still to be added to `domains`.
Protected Attributes inherited from frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable< U >, L extends Node< U > >
UtilitySolutionSpace< Val, U >	localProblem
	The list of spaces this variable is responsible for.
int	numberOfLocalVariables
	The number of local variables in the local problem.
IteratorBestFirst< Val, U >	localProblemIterator
	Iterator that returns solutions to the local problem in a best first order.
final U	infeasibleUtil
	The -infinite utility.
final U	zero
	The zero utility.
int	numberOfSpaces
	The number of spaces that together comprise the local problem.
Class<?>	domainElementClass
	domain element used for reflection
int	numberOfVariables
	The number of variables in the local problem.
String[]	depthToVariable
	Links a level in the tree with its corresponding variable.
String	ownVariable
	The variable that controls this LeafNodeTree.
int	depthFinalVariable
	The depth of the last variable in the tree.
Val[]	ownVarDomain
	The domain of `ownVariable`.
String[]	outsideVariables
	The variables as they should be communicated with the outside world.
int[]	valuesToBeRemoved
	Contains the indices of the values that need to be removed from the assigment before being send upwards.
int	depthOfFirstToBeRemovedVariables
	All variables below this depth must be removed when sending a good.
HashMap< String, Integer >	outsideVariablesMapping
	A mapping from outside variables to inside variables.
final boolean	maximize
	`true` when we are maximizing, and false otherwise
long	totalSeparatorSpaceSize = 1
	The size of the separator space.

Static Protected Attributes
static final long	serialVersionUID = 4206985864919963001L
	Used for serialization.

Private Member Functions
InnerNode< U, L >	createPathWithUB (int depth, IntArrayWrapper currentPath, int[] partialPath, boolean real, Good< Val, U > g, int sender)
	Given a partial path, this method creates the path in the tree.
InnerNode< U, L >	fillTree (InnerNode< U, L > example, int depth, IntArrayWrapper currentPath, boolean onLocalPath, final boolean withUB, boolean onPartialPath, int[] partialPath, Good< Val, U > g, int sender, boolean ex)
	Fills a part of the tree that has been created by the reception of a new domain value.
boolean	checkUpperBoundSums (int child, U newBound)
	Method to check the precomputation of the upper bound sums.
boolean	compareWithHypercube (int depth, Val[] currentPath, InnerNode< U, L > currentNode, UtilitySolutionSpace< Val, U > h)
	Method to check the initialization of the tree.
U	findMaxUB (int depth, InnerNode< U, L > currentNode)
	Method to find the maximal upper bound in the tree.
int	treeSize (int depth, int visited, Node< U > currentNode)
	Counts the number of leaves in the tree.
String	generateAssignments (int depth, int[] currentPath, InnerNode< U, L > currentNode)
	Used to print thte contents of the tree.

Additional Inherited Members
Public Attributes inherited from frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable< U >, L extends Node< U > >
final boolean	COLLECT_STATISTICS
	`true` when statistics should be collected, and `false` otherwise

Detailed Description

This class is designed to store GOODs received by a node from its children, and is used in the O-DPOP algorithm.

A GOOD contains an assignment to a set of variables, and a utility. A GOOD is identified by its assignment, and in this class the GOODs are ordered using a tree based on these assignments.

The basic functionality of this class is to either add a received GOOD to the tree, or to obtain the assignment that has the highest utility.

Author: Brammert

Parameters

<Val>	type used for variable values
<U>	type used for utility values
<L>	type used for the leaf node

Todo: write Unit test for this class

Constructor & Destructor Documentation

◆ InnerNodeTree() [1/6]

frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >.InnerNodeTree	(	String	ownVariable,
		Val[]	ownVariableDomain,
		UtilitySolutionSpace< Val, U >	space,
		U	zero,
		int	numberOfChildren,
		U	infeasibleUtil,
		boolean	maximize,
		boolean	collectStats )

protected

A constructor.

Parameters

ownVariable	The variable that owns this tree
ownVariableDomain	The domain of `ownVariable`
space	The space controlled by this tree
zero	The zero utility
numberOfChildren	The number of children of this tree
infeasibleUtil	The infeasible utility
maximize	when `true` we are maximizing, when `false` we are minimizing
collectStats	`true` when statistics should be collected, and `false` otherwise

References frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.infeasibleUtil, frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.maximize, numberOfChildren, frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.ownVariable, and frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.zero.

◆ InnerNodeTree() [2/6]

frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >.InnerNodeTree	(	String	ownVariable,
		Val[]	ownVariableDomain,
		List< UtilitySolutionSpace< Val, U > >	spaces,
		U	zero,
		int	numberOfChildren,
		U	infeasibleUtil,
		boolean	maximize,
		boolean	collectStats )

A constructor.

Parameters

ownVariable	The variable that owns this tree
ownVariableDomain	The domain of `ownVariable`
spaces	The space controlled by this tree
zero	The zero utility
numberOfChildren	The number of children of this tree
infeasibleUtil	The infeasible utility
maximize	when `true` we are maximizing, when `false` we are minimizing
collectStats	`true` when statistics should be collected, and `false` otherwise

References frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.infeasibleUtil, frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.maximize, numberOfChildren, frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.ownVariable, and frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.zero.

◆ InnerNodeTree() [3/6]

frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >.InnerNodeTree	(	L	leafNodeInstance,
		String	ownVariable,
		Val[]	ownVariableDomain,
		UtilitySolutionSpace< Val, U >	space,
		U	zero,
		int	numberOfChildren,
		U	infeasibleUtil,
		boolean	maximize,
		boolean	collectStats )

protected

A dummy constructor to be used by extending classes.

Parameters

leafNodeInstance	an instance of the leaf node class
ownVariable	The variable that owns this tree
ownVariableDomain	The domain of `ownVariable`
space	The local problem
zero	The zero utility
numberOfChildren	The number of children of this tree
infeasibleUtil	The infeasible utility
maximize	when `true` we are maximizing, when `false` we are minimizing
collectStats	`true` when statistics should be collected, and `false` otherwise

References frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.infeasibleUtil, leafNodeInstance, frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.localProblem, frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.maximize, numberOfChildren, frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.ownVariable, and frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.zero.

◆ InnerNodeTree() [4/6]

frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >.InnerNodeTree	(	L	leafNodeInstance,
		String	ownVariable,
		Val[]	ownVariableDomain,
		List< UtilitySolutionSpace< Val, U > >	spaces,
		U	zero,
		int	numberOfChildren,
		U	infeasibleUtil,
		boolean	maximize,
		boolean	collectStats )

protected

A dummy constructor to be used by extending classes.

Parameters

leafNodeInstance	an instance of the leaf node class
ownVariable	The variable that owns this tree
ownVariableDomain	The domain of `ownVariable`
spaces	The local problem
zero	The zero utility
numberOfChildren	The number of children of this tree
infeasibleUtil	The infeasible utility
maximize	when `true` we are maximizing, when `false` we are minimizing
collectStats	`true` when statistics should be collected, and `false` otherwise

References frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.infeasibleUtil, leafNodeInstance, frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.localProblem, frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.maximize, numberOfChildren, frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.ownVariable, and frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.zero.

◆ InnerNodeTree() [5/6]

frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >.InnerNodeTree	(	String	ownVariable,
		Val[]	ownVariableDomain,
		UtilitySolutionSpace< Val, U >	space,
		int	numberOfChildren,
		U	zero,
		L	leafNodeInstance,
		U	infeasibleUtil,
		boolean	maximize,
		boolean	collectStats )

A constructor.

Warning: we assume that the agent's own variable is put in the end of variables_order

Parameters

ownVariable	The variable ID
ownVariableDomain	The domain of `ownVariable`
space	The hypercube representing the local problem
numberOfChildren	The number of children
zero	The zero utility
leafNodeInstance	an instance of the leaf node class
infeasibleUtil	The infeasible utility
maximize	when `true` we are maximizing, when `false` we are minimizing
collectStats	`true` when statistics should be collected, and `false` otherwise

References createInnerNode(), domainSize, fullInfo, hasLocalProblem, frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.infeasibleUtil, init(), leafNodeInstance, frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.localProblem, frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.maximize, numberOfChildren, frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.ownVariable, root, frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.solveLocalProblem(), updateLocalProblem(), and frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.zero.

Here is the call graph for this function:

◆ InnerNodeTree() [6/6]

frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >.InnerNodeTree	(	String	ownVariable,
		Val[]	ownVariableDomain,
		List< UtilitySolutionSpace< Val, U > >	spaces,
		int	numberOfChildren,
		U	zero,
		L	leafNodeInstance,
		U	infeasibleUtil,
		boolean	maximize,
		boolean	collectStats )

A constructor.

Warning: we assume that the agents own variable is put in the end of variables_order

Parameters

ownVariable	The variable ID
ownVariableDomain	The domain of `ownVariable`
spaces	The hypercubes representing the local problem
numberOfChildren	The number of children
zero	The zero utility
leafNodeInstance	an instance of the leaf node class
infeasibleUtil	The infeasible utility
maximize	when `true` we are maximizing, when `false` we are minimizing
collectStats	`true` when statistics should be collected, and `false` otherwise

References createInnerNode(), domainSize, fullInfo, hasLocalProblem, frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.infeasibleUtil, init(), leafNodeInstance, frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.localProblem, frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.maximize, numberOfChildren, frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.numberOfVariables, frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.ownVariable, root, frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.solveLocalProblem(), updateLocalProblem(), and frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.zero.

Here is the call graph for this function:

Member Function Documentation

◆ add()

boolean frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >.add	(	Good< Val, U >	g,
		int	sender,
		HashMap< String, Val[]>	domains )

Adds a good to the tree.

Author: Brammert Ottens, 10 nov 2009

Parameters

g	the good to be added
sender	the child that reported the good
domains	reported domains

Returns: true when a new variable has been added, and false otherwise

Reimplemented from frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.

Here is the call graph for this function:

◆ addNewVariable()

int[] frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >.addNewVariable	(	String[]	allVariables,
		HashMap< String, Val >	newVariables,
		HashMap< String, Val[]>	newDomains,
		int	sender )

protected

This method adds new variables to the data structure.

Parameters

allVariables	The current variables
newVariables	The variables to be added
newDomains	The received domain values
sender	The child that reported the variables

Returns: the number of new variables

References branchingFactor, childrenVariables, frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.depthFinalVariable, frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.depthOfFirstToBeRemovedVariables, frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.depthToVariable, domains, domainSize, finalDomainSize, finalDomainSizeReceiver(), hasLocalProblem, localCounter, numberOfChildren, frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.numberOfVariables, optimalLocalPath, frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.outsideVariables, ownVariables, valuePointers, and variableToDepth.

Referenced by add().

Here is the call graph for this function:

◆ addVariableToTree()

boolean frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >.addVariableToTree	(	int	nbrNewVariables,
		IntArrayWrapper	currentPath,
		int[]	indexPath,
		int	depth,
		InnerNode< U, L >	oldRoot,
		InnerNode< U, L >	currentNode,
		boolean	possibleInconsistencies,
		boolean	onIndexPath,
		int	sender )

protected

This method is called when variables are received.

The new variables are placed at the root

Parameters

nbrNewVariables	The number of variables to add
currentPath	The path currently taken through the tree
indexPath	The partial path defined by the new variables
depth	The current depth
oldRoot	The old root
currentNode	The current node
possibleInconsistencies	`true` when the reception of a new variable can make certain solutions infeasible
onIndexPath	`true` when still following the index path
sender	The sender of the good

Returns: true when a node has been added to the tree

Referenced by add(), and addVariableToTree().

Here is the call graph for this function:

◆ checkLeaf()

boolean frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >.checkLeaf	(	L	leaf,
		IntArrayWrapper	currentPath,
		boolean	checkUB,
		U	utility,
		int	sender )

Method to check that the utility and UB are consistent with the available information.

The utility should match exactly, but because UBs are only recomputed when necessary, and then should only decrease by such a recomputation, the stored UB should be at least as high as the real UB

Parameters

leaf	the leaf to be checked
currentPath	the path to this leaf
checkUB	`true` when the UB must be checked
utility	the utility reported by the sender
sender	the sender of the good

Returns: always returns true

References childrenVariables, frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable, L extends LeafNode >.IntArrayWrapper.getPartialAssignment(), getUtilityLocalProblem(), goodsReceived, frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.greaterThanOrEqual(), frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.infeasibleUtil, numberOfChildren, oldUB, upperBounds, and frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.zero.

Referenced by createLeaf(), createLeaf(), createPathWithUB(), and fillTree().

Here is the call graph for this function:

◆ checkTree()

boolean frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >.checkTree	(	int	depth,
		InnerNode< U, L >	currentNode,
		IntArrayWrapper	currentPath,
		boolean	UB,
		boolean	checkLeafs,
		boolean	checkSupport,
		boolean	checkUtil )

protected

This method checks the tree on the following properties.

the UB is properly propagated
the utility is properly propagated
every leaf node with support is present
no UB is greater than the old upper bound

Parameters

depth	the current depth
currentNode	the current node being visited
currentPath	the current path taken
UB	the current UB
checkLeafs	`true` when the leaves are to be checked
checkSupport	`check` whether existing leaf nodes actually have support
checkUtil	`true` when utility values should be checked

Returns: always returns true

References branchingFactor, and checkTree().

Referenced by add(), checkTree(), fillTree(), and initiateBounds().

Here is the call graph for this function:

◆ checkUpperBoundSums()

boolean frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >.checkUpperBoundSums	(	int	child,
		U	newBound )

private

Method to check the precomputation of the upper bound sums.

Author: Brammert Ottens, 26 jun 2009

Parameters

child	the child that reported a new bound
newBound	the new bound

Returns: true

References checkUpperBoundSums(), numberOfChildren, upperBounds, upperBoundSums, and frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.zero.

Referenced by checkUpperBoundSums(), and updateUpperBoundSums().

Here is the call graph for this function:

◆ compareWithHypercube() [1/2]

boolean frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >.compareWithHypercube	(	int	depth,
		Val[]	currentPath,
		InnerNode< U, L >	currentNode,
		UtilitySolutionSpace< Val, U >	h )

private

Method to check the initialization of the tree.

Parameters

depth	the current depth
currentPath	the current path
currentNode	the current node
h	the hypercube to compare with

Returns: true when this tree matches the hypercube

References branchingFactor, compareWithHypercube(), frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.depthFinalVariable, frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.depthToVariable, domains, and frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNode, L extends LeafNode >.getChild().

Here is the call graph for this function:

◆ compareWithHypercube() [2/2]

boolean frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable, L extends LeafNode >.compareWithHypercube ( UtilitySolutionSpace< Val, U > h )

Method to check the initialization of the tree.

Parameters

h	the hypercube to compare with

Returns: true when this tree matches the hypercube

Bug: Never used!

References compareWithHypercube(), frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.depthToVariable, domains, frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.numberOfVariables, and root.

Referenced by compareWithHypercube(), and compareWithHypercube().

Here is the call graph for this function:

◆ createInnerNode() [1/2]

InnerNode< U, L > frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable, L extends LeafNode >.createInnerNode ( int numberOfChildren )

protected

Create an inner node with a specified number of children.

Author: Brammert Ottens, 22 apr 2010

Parameters

numberOfChildren the number of children this innernode should have

Returns: an InnerNode

References numberOfChildren.

Referenced by add(), addVariableToTree(), createPathNoUB(), createPathWithUB(), fillTree(), InnerNodeTree(), and InnerNodeTree().

◆ createInnerNode() [2/2]

InnerNode< U, L > frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable, L extends LeafNode >.createInnerNode ( Node[] children )

protected

Create an inner node with the specified number of children.

Author: Brammert Ottens, 22 apr 2010

Parameters

children an array of child nodes

Returns: an InnerNode

◆ createIntArrayWrapper() [1/2]

IntArrayWrapper frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable, L extends LeafNode >.createIntArrayWrapper ( int size )

Author: Brammert Ottens, 22 apr 2010

Parameters

size	the size of an array

Returns: a wrapper around an array with size size

◆ createIntArrayWrapper() [2/2]

IntArrayWrapper frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable, L extends LeafNode >.createIntArrayWrapper ( int[] array )

Author: Brammert Ottens, 22 apr 2010

Parameters

array an array to be wrapped

Returns: a wrapper around the array

Referenced by addVariableToTree(), and toKey().

◆ createLeaf() [1/2]

L frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >.createLeaf	(	IntArrayWrapper	currentPath,
		final boolean	withUB )

protected

Method to create a new leaf node.

Parameters

currentPath	The path to the leaf
withUB	`true` when the upper bound must be set

Returns: the new leaf node

References frodo2.solutionSpaces.AddableDelayed< T extends Addable< T > >.addDelayed(), checkLeaf(), childrenVariables, frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.COLLECT_STATISTICS, frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.countLeafNode(), frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.LeafNode >.fromBooleanArrayToInt(), frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable, L extends LeafNode >.IntArrayWrapper.getPartialAssignment(), getUtilityLocalProblem(), goodsReceived, hasSupport(), frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.infeasibleUtil, leafNodeInstance, numberOfChildren, powersOf2, frodo2.solutionSpaces.AddableDelayed< T extends Addable< T > >.resolve(), and upperBoundSums.

Here is the call graph for this function:

◆ createLeaf() [2/2]

L frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >.createLeaf	(	IntArrayWrapper	currentPath,
		Good< Val, U >	g,
		int	child,
		final boolean	withUB )

protected

Method to create a new leaf node.

Parameters

currentPath	The path to the leaf
g	the received good
child	the child that reported it
withUB	`true` when the upper bound must be set

Returns: the new leaf node

References frodo2.solutionSpaces.AddableDelayed< T extends Addable< T > >.addDelayed(), checkLeaf(), childrenVariables, frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.COLLECT_STATISTICS, frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.countLeafNode(), frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.LeafNode >.fromBooleanArrayToInt(), frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable, L extends LeafNode >.IntArrayWrapper.getPartialAssignment(), frodo2.algorithms.odpop.Good< Val extends Addable< Val >, U extends Addable >.getUtility(), getUtilityLocalProblem(), goodsReceived, hasSupport(), frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.infeasibleUtil, leafNodeInstance, numberOfChildren, powersOf2, frodo2.solutionSpaces.AddableDelayed< T extends Addable< T > >.resolve(), and upperBoundSums.

Referenced by createPathNoUB(), createPathWithUB(), and fillTree().

Here is the call graph for this function:

◆ createPathNoUB()

InnerNode< U, L > frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >.createPathNoUB	(	int	depth,
		IntArrayWrapper	currentPath,
		int[]	partialPath,
		boolean	real,
		Good< Val, U >	g,
		int	sender )

protected

Given a partial path, this method creates the path in the tree.

This method should only be called after domain information is complete!

Parameters

depth	the current depth
currentPath	the path taken
partialPath	the partial path defined by the received good
real	`true` when we are on a real path, and false otherwise
g	the received good
sender	the sender of the good

Returns: a new InnerNode

Referenced by createPathNoUB().

Here is the call graph for this function:

◆ createPathWithUB()

InnerNode< U, L > frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >.createPathWithUB	(	int	depth,
		IntArrayWrapper	currentPath,
		int[]	partialPath,
		boolean	real,
		Good< Val, U >	g,
		int	sender )

private

Given a partial path, this method creates the path in the tree.

This method should only be called after domain information is complete!

Parameters

depth	the current depth
currentPath	the path taking in the tree
partialPath	the partial path defined by the received good
real	`true` when we are on a real path, and false otherwise
g	the received good
sender	the sender of the good

Returns: a new InnerNode

Referenced by createPathWithUB().

Here is the call graph for this function:

◆ fillTree()

InnerNode< U, L > frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >.fillTree	(	InnerNode< U, L >	example,
		int	depth,
		IntArrayWrapper	currentPath,
		boolean	onLocalPath,
		final boolean	withUB,
		boolean	onPartialPath,
		int[]	partialPath,
		Good< Val, U >	g,
		int	sender,
		boolean	ex )

private

Fills a part of the tree that has been created by the reception of a new domain value.

Author: Brammert Ottens, 30 sep 2009

Parameters

example	the example that is to be copied
depth	the current depth
currentPath	the current path taken through the tree. Is only up to date up to depth
onLocalPath	`true` when we are still following the path of the currently best local solution
withUB	`true` when the UB must be instatiated as well
onPartialPath	`true` then the followed path is the same as the path defined by the received good
partialPath	the path defined by the received good
g	the received good
sender	the sender of the good
ex

Todo

Returns: a new node

Referenced by addVariableToTree(), and fillTree().

Here is the call graph for this function:

◆ finalDomainSizeReceiver()

void frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable, L extends LeafNode >.finalDomainSizeReceiver ( )

protected

logs the reception of a domain size info message

References fullInfo, fullInfoCounter, frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.numberOfVariables, and frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.totalSeparatorSpaceSize.

Referenced by addNewVariable().

◆ findMaxUB()

U frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >.findMaxUB	(	int	depth,
		InnerNode< U, L >	currentNode )

private

Method to find the maximal upper bound in the tree.

Used for debugging.

Parameters

depth	the current depth
currentNode	the current node

Returns: the maximal upper bound present in the tree

References branchingFactor, frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.depthFinalVariable, findMaxUB(), frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNode, L extends LeafNode >.getChild(), frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.greaterThanOrEqual(), frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.infeasibleUtil, frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.Node >.isAlive(), and upperBoundSums.

Referenced by findMaxUB().

Here is the call graph for this function:

◆ generateAssignments()

String frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >.generateAssignments	(	int	depth,
		int[]	currentPath,
		InnerNode< U, L >	currentNode )

private

Used to print thte contents of the tree.

Author: Brammert Ottens, 25 feb 2010

Parameters

depth	the current depth in the tree
currentPath	the path taken through the tree
currentNode	the curent node being visited

Returns: a string representation of the contents of the tree

References branchingFactor, frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.depthFinalVariable, frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.depthToVariable, domains, domainSize, generateAssignments(), and frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNode, L extends LeafNode >.getChild().

Referenced by generateAssignments(), and toString().

Here is the call graph for this function:

◆ getAmax()

Good< Val, U > frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable, L extends LeafNode >.getAmax ( )

See also: frodo2.algorithms.odpop.goodsTree.GoodsTree.getAmax()

Reimplemented from frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.

Referenced by getAmax().

Here is the call graph for this function:

◆ getBestAssignmentForOwnVariable()

void frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable, L extends LeafNode >.getBestAssignmentForOwnVariable ( HashMap< String, Val > contextMap )

See also: frodo2.algorithms.odpop.goodsTree.GoodsTree.getBestAssignmentForOwnVariable(java.util.HashMap)

Reimplemented from frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.

References frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.depthFinalVariable, frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.depthToVariable, getOwnVariableOptions(), frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.numberOfVariables, and variableToDepth.

Here is the call graph for this function:

◆ getChildSeparatorReportingOrder()

String[] frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable, L extends LeafNode >.getChildSeparatorReportingOrder ( int child )

Returns the variables in the childs separator in the order it reported them.

Author: Brammert Ottens, 19 aug 2009

Parameters

child the child who's separator we want to know

Returns: the separator variables of the child

Reimplemented from frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.

References childrenVariablesReportingOrder.

◆ getChildSeparatorSize()

int frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable, L extends LeafNode >.getChildSeparatorSize ( int child )

Author: Brammert Ottens, 8 sep 2009

Parameters

child the child who's separator size is requested

Returns: the separator size of the child

◆ getChildValues()

HashMap< String, Val > frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >.getChildValues	(	HashMap< String, Val >	parentContext,
		int	child )

Given a map that maps variables to values, this method returns the values belonging to the variables in a child's separator.

Author: Brammert Ottens, 19 aug 2009

Parameters

parentContext	the value map
child	the child for who we want to know the separator values

Returns: an array containing the values of the child's separator variables

Reimplemented from frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.

References childrenVariablesReportingOrder.

◆ getDomains()

Val[][] frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable, L extends LeafNode >.getDomains ( )

See also: frodo2.algorithms.odpop.goodsTree.GoodsTree.getDomains()

Reimplemented from frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.

References frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.depthToVariable, domains, getDomains(), and frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.numberOfVariables.

Referenced by getDomains().

Here is the call graph for this function:

◆ getFinalDomainSize()

int[] frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable, L extends LeafNode >.getFinalDomainSize ( )

See also: frodo2.algorithms.odpop.goodsTree.GoodsTree.getFinalDomainSize()

Reimplemented from frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.

References frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.depthOfFirstToBeRemovedVariables, finalDomainSize, and stillToSend.

◆ getOwnVariableOptions() [1/2]

U frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >.getOwnVariableOptions	(	int[]	path,
		int[]	optimalPath,
		U	maxUtil,
		int	depth,
		InnerNode< U, L >	currentNode )

protected

Given a possibly partial path, this method finds the maximal utility any option can provide.

Todo: also look at other things than max

Parameters

path	the (possibly partial) path to be followed
optimalPath	the path trough the tree that leads to the optimal leafnode
maxUtil	the opimal utility
depth	the current depth
currentNode	the current node

Returns: for every option a utility

References frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.depthFinalVariable, domainSize, frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNode, L extends LeafNode >.getChild(), getOwnVariableOptions(), and frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.greaterThan().

Here is the call graph for this function:

◆ getOwnVariableOptions() [2/2]

int[] frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable, L extends LeafNode >.getOwnVariableOptions ( Val[] assignments )

protected

Given the assignment of variables in its separator, this method returns the utility for all domain elements of the own variable.

Parameters

assignments collection of assignments of variables in the separator

Returns: an array of utilities

References frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.depthFinalVariable, frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.depthToVariable, getOwnVariableOptions(), frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.infeasibleUtil, frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.numberOfVariables, root, and valuePointers.

Referenced by getBestAssignmentForOwnVariable(), getOwnVariableOptions(), and getOwnVariableOptions().

Here is the call graph for this function:

◆ getUtilityLocalProblem()

U frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable, L extends LeafNode >.getUtilityLocalProblem ( IntArrayWrapper currentPath )

protected

Given an assignment to all the variables, represented as a path in the tree, this method returns the utility given by the variable's local problem.

Author: Brammert Ottens, 1 jul 2009

Parameters

currentPath the variable assignment

Returns: the utility corresponding to the variable assignment

References frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.depthToVariable, frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.domainElementClass, domains, getUtilityLocalProblem(), hasLocalProblem, frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.localProblem, frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.numberOfVariables, and frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.zero.

Referenced by checkLeaf(), createLeaf(), createLeaf(), getUtilityLocalProblem(), hasSupport(), and removeInconsistencies().

Here is the call graph for this function:

◆ hasFullInfo()

boolean frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable, L extends LeafNode >.hasFullInfo ( )

See also: frodo2.algorithms.odpop.goodsTree.GoodsTree.hasFullInfo()

Reimplemented from frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.

◆ hasMore()

boolean frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable, L extends LeafNode >.hasMore ( )

See also: frodo2.algorithms.odpop.goodsTree.GoodsTree.hasMore()

Reimplemented from frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.

References root.

◆ hasSupport()

boolean frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable, L extends LeafNode >.hasSupport ( IntArrayWrapper currentPath )

protected

Method to check whether a particular leaf node has support, i.e.

some child has reported an assignment compatible with currentPath

Parameters

currentPath the path that leads to the leaf

Returns: true if the path has support and false otherwise

References childrenVariables, frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable, L extends LeafNode >.IntArrayWrapper.getPartialAssignment(), getUtilityLocalProblem(), goodsReceived, hasSupport(), frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.infeasibleUtil, numberOfChildren, and storeReceivedGoods.

Referenced by createLeaf(), createLeaf(), and hasSupport().

Here is the call graph for this function:

◆ init()

void frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >.init	(	int	numberOfChildren,
		U	zero )

protected

Initialize all the variables of the tree.

Parameters

numberOfChildren	The number of children
zero	The zero utility

References branchingFactor, childrenVariables, childrenVariablesReportingOrder, frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.depthFinalVariable, frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.depthToVariable, domains, domainSize, finalDomainSize, fullInfoCounter, goodsReceived, init(), localCounter, frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.localProblem, maxNumberLocalProblemOccurences, numberOfChildren, frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.numberOfVariables, frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.ownVarDomain, frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.ownVariable, ownVariables, powersOf2, separatorSizePerChild, toBeProcessedDomains, unpackedVariablesPerChild, upperBoundIsInfiniteCounter, upperBoundIsMinInfiniteCounter, upperBounds, valuePointers, variableToDepth, and frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.zero.

Referenced by init(), InnerNodeTree(), and InnerNodeTree().

Here is the call graph for this function:

◆ initializeUpperBoundSums()

void frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable, L extends LeafNode >.initializeUpperBoundSums ( )

protected

Initializes both the sum of bounds array and the powersOf2 array.

Author: Brammert Ottens, 25 jun 2009

References frodo2.solutionSpaces.AddableDelayed< T extends Addable< T > >.addDelayed(), hasLocalProblem, initializeUpperBoundSums(), localUpperBound, numberOfChildren, optimalLocalUtility, frodo2.solutionSpaces.AddableDelayed< T extends Addable< T > >.resolve(), upperBounds, upperBoundSums, and frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.zero.

Referenced by add(), and initializeUpperBoundSums().

Here is the call graph for this function:

◆ initiateBounds()

U frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >.initiateBounds	(	InnerNode< U, L >	currentNode,
		IntArrayWrapper	currentPath,
		int	depth,
		boolean	onLocalPath,
		Good< Val, U >	g,
		int	sender )

protected

This method instantiates the upper bounds.

Parameters

currentNode	the node currently being visited
currentPath	the path taken
depth	the current depth
onLocalPath	`true` when we are still following the path of the currently best local solution
g	the received good
sender	the sender of the good

Returns: the upperBound for this node

References branchingFactor, checkTree(), frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.depthFinalVariable, frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.depthToVariable, domains, frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNode, L extends LeafNode >.getChild(), frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNode, L extends LeafNode >.getUtil(), initiateBounds(), frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.maximize, optimalLocalPath, frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNode, L extends LeafNode >.ubCandidate(), upperBoundSums, and frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNode, L extends LeafNode >.utilCandidate().

Referenced by add(), and initiateBounds().

Here is the call graph for this function:

◆ isValuationSufficient()

boolean frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable, L extends LeafNode >.isValuationSufficient ( )

See also: frodo2.algorithms.odpop.goodsTree.GoodsTree.isValuationSufficient()

Reimplemented from frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.

References frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.greaterThan(), frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.greaterThanOrEqual(), hasLocalProblem, frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.infeasibleUtil, localUpperBound, and root.

Here is the call graph for this function:

◆ knowsVariable()

boolean frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable, L extends LeafNode >.knowsVariable ( String variable )

See also: frodo2.algorithms.odpop.goodsTree.GoodsTree.knowsVariable(java.lang.String)

Reimplemented from frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.

References variableToDepth.

◆ localPathAlive()

boolean frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >.localPathAlive	(	int	depth,
		InnerNode< U, L >	currentNode )

protected

Used to check whether the local path chosen is still alive For debuggin purposes only.

Author: Brammert Ottens, 16 nov 2009

Parameters

depth	The current depth
currentNode	The current node being visisted

Returns: true when the current locally optimal solution is still allowed

References frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.depthFinalVariable, and localPathAlive().

Referenced by localPathAlive().

Here is the call graph for this function:

◆ notEnoughInfo()

boolean frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable, L extends LeafNode >.notEnoughInfo ( )

See also: frodo2.algorithms.odpop.goodsTree.GoodsTree.notEnoughInfo()

Reimplemented from frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.

References frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.numberOfVariables.

◆ pathAlive()

boolean frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >.pathAlive	(	int[]	path,
		int	depth,
		InnerNode< U, L >	currentNode )

protected

Method to check whether the (possibly) partial path is alive, i.e.

all inner nodes on the path either are alive or do not exists

Author: Brammert Ottens, 12 nov 2009

Parameters

path	the path to be checked
depth	the current depth
currentNode	the currently visited node

Returns: true when the path is alive or does not exist, and false otherwise

References frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.depthFinalVariable, and pathAlive().

Referenced by pathAlive(), removeAMax(), and updateLocalProblem().

Here is the call graph for this function:

◆ pathExists()

boolean frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable, L extends LeafNode >.pathExists ( Val[] values )

See also: frodo2.algorithms.odpop.goodsTree.GoodsTree#pathExists(Addable[])

Reimplemented from frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.

References frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.depthToVariable, frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.numberOfVariables, pathExists(), root, and valuePointers.

Referenced by pathExists().

Here is the call graph for this function:

◆ recalculateUB()

U frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >.recalculateUB	(	int	depth,
		InnerNode< U, L >	currentNodeUncast,
		U	UBtoBeat,
		boolean	recalculateUtil,
		boolean	recalculateUB )

protected

This method recalculates the upper bound for a particular node.

If the upper bound of this node is already up to date nothing happens. If not, the method searches further down the tree to find the actual current upper bound

Parameters

depth	the current depth
currentNodeUncast	the node that is currently visited
UBtoBeat	the UB that needs to be beat
recalculateUtil	`true` when the recalculation of the utility can make a difference higher up
recalculateUB	`true` when the recalculation of the upperbound can make a difference higher up

Returns: the new upper bound for currentNode

References frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNode, L extends LeafNode >.getMaxUB(), frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.infeasibleUtil, frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.Node >.isAlive(), recalculateUB(), and frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNode, L extends LeafNode >.recalculateUtil().

Referenced by recalculateUB(), removePath(), and setChildDone().

Here is the call graph for this function:

◆ removeAMax()

void frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable, L extends LeafNode >.removeAMax ( )

See also: frodo2.algorithms.odpop.goodsTree.GoodsTree.removeAMax()

Reimplemented from frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.

References hasLocalProblem, frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.infeasibleUtil, localCounter, localUpperBound, maxNumberLocalProblemOccurences, pathAlive(), removePath(), root, and updateLocalProblem().

Here is the call graph for this function:

◆ removeInconsistencies()

void frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >.removeInconsistencies	(	InnerNode< U, L >	currentNode,
		int	depth,
		IntArrayWrapper	currentPath )

protected

This method checks whether any of the leafnodes have become infeasible due to the addition of a new variable.

Author: Brammert Ottens, 27 jan 2010

Parameters

currentNode	the currently visited node
depth	the depth of this node
currentPath	the path take through the tree to get here

References branchingFactor, frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.depthFinalVariable, frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNode, L extends LeafNode >.getChild(), frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNode, L extends LeafNode >.getUtil(), getUtilityLocalProblem(), frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.infeasibleUtil, frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.maximize, removeInconsistencies(), and frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNode, L extends LeafNode >.utilCandidate().

Referenced by addVariableToTree(), and removeInconsistencies().

Here is the call graph for this function:

◆ removePath()

boolean frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >.removePath	(	int	depth,
		InnerNode< U, L >	currentNode,
		boolean	onLocalPath )

protected

This method finds the leaf node corresponding to the current best assignment, removes all its children and sets its parent node to a dead node.

Parameters

depth	the current depth
currentNode	the current node being visited
onLocalPath	`true` when we are still following the path of the currently best local solution

Returns: true when the local path has been removed

Referenced by removeAMax(), and removePath().

Here is the call graph for this function:

◆ setChildDone()

boolean frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable, L extends LeafNode >.setChildDone ( int child )

If a child has send a DONE message, the upper bound should be set to -infinity.

Author: Brammert Ottens, 30 sep 2009

Parameters

child the child that sent the DONE message

Returns: true when the remaining local problem became infeasible, and false otherwise

Reimplemented from frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.

References frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.LeafNode >.calculateUB(), frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.LeafNode >.getUB(), frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.greaterThan(), frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.infeasibleUtil, frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.maximize, recalculateUB(), root, and updateUpperBoundSums().

Here is the call graph for this function:

◆ setChildrenSeparator()

void frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >.setChildrenSeparator	(	int	child,
		String[]	variables )

Initializes the separator of a child.

This method should only be called when one receives the first message from a particular child. After that, the process of adding new variables should take care of the rest.

Parameters

child	the child whose separator must be set
variables	the variables in its separator

Reimplemented from frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.

References childrenVariablesReportingOrder.

◆ setFinalDomainSize()

void frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >.setFinalDomainSize	(	String[]	variables,
		int[]	domainSize )

See also: frodo2.algorithms.odpop.goodsTree.GoodsTree.setFinalDomainSize(java.lang.String[], int[])

Reimplemented from frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.

References domainSize.

◆ setOldUB()

boolean frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable, L extends LeafNode >.setOldUB ( )

protected

Used to set the old upperbound.

Author: Brammert Ottens, 30 sep 2009

Returns: always returns true

References frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.greaterThan(), hasLocalProblem, frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.infeasibleUtil, localUpperBound, frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.maximize, oldUB, root, and upperBoundSums.

Referenced by add().

Here is the call graph for this function:

◆ stillToSend()

boolean frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable, L extends LeafNode >.stillToSend ( )

See also: frodo2.algorithms.odpop.goodsTree.GoodsTree.stillToSend()

Reimplemented from frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.

References stillToSend.

◆ toKey()

IntArrayWrapper frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >.toKey	(	Val[]	values,
		String[]	variables,
		int	sender )

protected

Takes a good received by a child and transforms the assignment to a key.

Parameters

values	the values reported by the child
variables	the variables reported by the child
sender	the child that send the good

Returns: The key corresponding to the assignment of the good

References createIntArrayWrapper(), frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.numberOfVariables, valuePointers, and variableToDepth.

Referenced by add().

Here is the call graph for this function:

◆ toString()

String frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable, L extends LeafNode >.toString ( )

Method used for debugging purposes.

It prints the state of the tree

See also: java.lang.Object#toString()

References frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.depthOfFirstToBeRemovedVariables, frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.depthToVariable, generateAssignments(), goodsReceived, numberOfChildren, frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.numberOfVariables, optimalLocalPath, and root.

Here is the call graph for this function:

◆ treeSize() [1/2]

int frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable, L extends LeafNode >.treeSize ( )

Wrapper around treeSize(int, int, Node).

Returns: the number of leaves in the tree

References root, and treeSize().

Referenced by treeSize(), and treeSize().

Here is the call graph for this function:

◆ treeSize() [2/2]

int frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >.treeSize	(	int	depth,
		int	visited,
		Node< U >	currentNode )

private

Counts the number of leaves in the tree.

Parameters

depth	the current depth
visited	the number of leaves visited
currentNode	the currently visited node

Returns: the number of leaves in the tree

References frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.infeasibleUtil, frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.numberOfVariables, and treeSize().

Here is the call graph for this function:

◆ UBexists()

boolean frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >.UBexists	(	InnerNode< U, L >	currentNode,
		int	depth )

Test to see whether a leafnode used as upperbound actually exists, i.e.

to check whether the UB is correctly being updated

Author: Brammert Ottens, 5 okt 2009

Parameters

currentNode	the current node in the tree being visited
depth	the current depth

Returns: true when the leafnode exists, and false otherwise

References branchingFactor, frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.depthFinalVariable, frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNode, L extends LeafNode >.getChild(), frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNode, L extends LeafNode >.getMaxUB(), frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNode, L extends LeafNode >.hasUB(), and UBexists().

Referenced by removePath(), and UBexists().

Here is the call graph for this function:

◆ updateLocalProblem()

void frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable, L extends LeafNode >.updateLocalProblem ( )

protected

Author: Brammert Ottens, 16 nov 2009 Find the next best local solution that is still allowed

References frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.depthToVariable, frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.infeasibleUtil, frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.localProblemIterator, localUpperBound, frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.numberOfLocalVariables, frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.numberOfVariables, optimalLocalPath, optimalLocalUtility, pathAlive(), root, upperBoundIsInfiniteCounter, upperBoundSums, and valuePointers.

Referenced by InnerNodeTree(), InnerNodeTree(), and removeAMax().

Here is the call graph for this function:

◆ updatePath()

void frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >.updatePath	(	int	depth,
		IntArrayWrapper	currentPath,
		int[]	partialPath,
		InnerNode< U, L >	currentNode,
		Good< Val, U >	g,
		U	utilityDelta,
		int	sender,
		boolean	onLocalPath,
		final boolean	withUB )

protected

This method walks trough the tree according to the given partial path and finds all leaf nodes that correspond to assignments that are compatible with the good to be added.

Parameters

depth	The current depth
currentPath	The current path
partialPath	The path dictated by the received good
currentNode	The current node
g	the utility reported
utilityDelta	The difference with the previously reported utility for the assignment belonging to the partial path
sender	The sender of the good
onLocalPath	`true` when we are still following the path of the currently best local solution
withUB	`true` when the UB must be updated as well

References frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.depthToVariable, domains, frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.infeasibleUtil, frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.maximize, updatePath(), and upperBoundSums.

Referenced by add(), and updatePath().

Here is the call graph for this function:

◆ updateUpperBoundSums()

void frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >.updateUpperBoundSums	(	int	child,
		U	oldBound,
		U	newBound )

protected

Updates the upperBoundSums array given the child that has changed its bound, the old bound and the new bound.

Author: Brammert Ottens, 25 jun 2009

Parameters

child	The child whose bound has changed
oldBound	The old bound
newBound	The new bound

References checkUpperBoundSums(), hasLocalProblem, frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.infeasibleUtil, localUpperBound, numberOfChildren, optimalLocalUtility, upperBoundSums, and frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.zero.

Referenced by add(), and setChildDone().

Here is the call graph for this function:

◆ upperBoundChangesUtil()

boolean frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >.upperBoundChangesUtil	(	InnerNode< U, L >	node,
		U	UB )

protected

Author: Brammert Ottens, 22 apr 2010

Parameters

node	the node to be checked
UB	its newly calculated upper bound

Returns: true when UB equals minInfinte

References frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.infeasibleUtil.

◆ Utilexists()

boolean frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >.Utilexists	(	InnerNode< U, L >	currentNode,
		int	depth )

Checks whether the maxUtil of a node actually exists.

Author: Brammert Ottens, 12 okt 2009

Parameters

currentNode	the current node
depth	the current depth

Returns: true when the util node exists, and false otherwise

References branchingFactor, frodo2.algorithms.odpop.goodsTree.GoodsTree< Val extends Addable< Val >, U extends Addable, L extends Node >.depthFinalVariable, frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNode, L extends LeafNode >.getChild(), frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNode, L extends LeafNode >.getMaxUtil(), frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNode, L extends LeafNode >.getUtil(), frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.LeafNode >.getUtil(), frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNode, L extends LeafNode >.hasUtil(), and Utilexists().

Referenced by removePath(), and Utilexists().

Here is the call graph for this function:

Member Data Documentation

◆ branchingFactor

int [] frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable, L extends LeafNode >.branchingFactor

protected

For every level of the tree, it stores the branching factor.

Referenced by add(), addNewVariable(), addVariableToTree(), checkTree(), compareWithHypercube(), createPathNoUB(), createPathWithUB(), fillTree(), findMaxUB(), generateAssignments(), getAmax(), init(), initiateBounds(), removeInconsistencies(), UBexists(), and Utilexists().

◆ childrenVariables

boolean [][] frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable, L extends LeafNode >.childrenVariables

protected

Stores which variables are in a child's separator.

Referenced by add(), addNewVariable(), checkLeaf(), createLeaf(), createLeaf(), hasSupport(), and init().

◆ childrenVariablesReportingOrder

String [][] frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable, L extends LeafNode >.childrenVariablesReportingOrder

protected

For each child it stores the order in which the variables are reported.

Referenced by getChildSeparatorReportingOrder(), getChildValues(), init(), and setChildrenSeparator().

◆ domains

HashMap<String, ArrayList<Val> > frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable, L extends LeafNode >.domains

protected

The variable domains, where the position in the ArrayList denotes which child corresponds to the value.

Referenced by add(), addNewVariable(), compareWithHypercube(), compareWithHypercube(), createPathNoUB(), createPathWithUB(), fillTree(), generateAssignments(), getAmax(), getDomains(), getUtilityLocalProblem(), init(), initiateBounds(), removePath(), and updatePath().

◆ domainSize

int [] frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable, L extends LeafNode >.domainSize

protected

Stores, for a level in the tree, the size of the domain of the corresponding variable.

Referenced by addNewVariable(), generateAssignments(), getAmax(), getOwnVariableOptions(), init(), InnerNodeTree(), InnerNodeTree(), and setFinalDomainSize().

◆ finalDomainSize

int [] frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable, L extends LeafNode >.finalDomainSize

protected

Stores the final sizes of the domains of all the variables.

Referenced by addNewVariable(), getFinalDomainSize(), and init().

◆ fullInfo

boolean frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable, L extends LeafNode >.fullInfo

protected

True when the information on the final domain size is complete.

Referenced by finalDomainSizeReceiver(), InnerNodeTree(), and InnerNodeTree().

◆ fullInfoCounter

int frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable, L extends LeafNode >.fullInfoCounter

protected

Counts the number of children from which one still needs to receive domain information.

Referenced by finalDomainSizeReceiver(), and init().

◆ goodsReceived

ArrayList<HashMap<IntArrayWrapper, U> > frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable, L extends LeafNode >.goodsReceived

protected

For each child a map that stores the utilities received from children.

This is needed due to the assumption that both domain and variable information can be incomplete

Referenced by add(), checkLeaf(), createLeaf(), createLeaf(), hasSupport(), init(), and toString().

◆ hasLocalProblem

boolean frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable, L extends LeafNode >.hasLocalProblem

protected

true when this variable has a local problem, and false otherwise

Referenced by addNewVariable(), getAmax(), getUtilityLocalProblem(), initializeUpperBoundSums(), InnerNodeTree(), InnerNodeTree(), isValuationSufficient(), removeAMax(), setOldUB(), and updateUpperBoundSums().

◆ leafNodeInstance

L frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable, L extends LeafNode >.leafNodeInstance

protected

An instance of a leaf node, used to create new instances.

Referenced by createLeaf(), createLeaf(), InnerNodeTree(), InnerNodeTree(), InnerNodeTree(), and InnerNodeTree().

◆ localCounter

int frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable, L extends LeafNode >.localCounter

protected

The number of times the currently best local solution has NOT been used in the tree, i.e.

it counts down to 0

Referenced by add(), addNewVariable(), init(), removeAMax(), and removePath().

◆ localUpperBound

U frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable, L extends LeafNode >.localUpperBound

protected

The upperbound on all the completely unseen assignments.

Referenced by getAmax(), initializeUpperBoundSums(), isValuationSufficient(), removeAMax(), setOldUB(), updateLocalProblem(), and updateUpperBoundSums().

◆ maxNumberLocalProblemOccurences

int frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable, L extends LeafNode >.maxNumberLocalProblemOccurences

protected

The total number of times a solution to a local problem can be used in the separator problem.

Referenced by init(), removeAMax(), and removePath().

◆ numberOfChildren

int frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable, L extends LeafNode >.numberOfChildren

protected

The number of children of the variable.

Referenced by add(), addNewVariable(), checkLeaf(), checkUpperBoundSums(), createInnerNode(), createLeaf(), createLeaf(), hasSupport(), init(), initializeUpperBoundSums(), InnerNodeTree(), InnerNodeTree(), InnerNodeTree(), InnerNodeTree(), InnerNodeTree(), InnerNodeTree(), toString(), and updateUpperBoundSums().

◆ oldUB

U frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable, L extends LeafNode >.oldUB

protected

Stores the UB as it was before a new good has been received.

Referenced by add(), checkLeaf(), fillTree(), and setOldUB().

◆ optimalLocalPath

int [] frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable, L extends LeafNode >.optimalLocalPath

protected

The path of the currently optimal local solution.

Referenced by addNewVariable(), initiateBounds(), removePath(), toString(), and updateLocalProblem().

◆ optimalLocalUtility

U frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable, L extends LeafNode >.optimalLocalUtility

protected

The optimal utility of the local problem.

Referenced by initializeUpperBoundSums(), updateLocalProblem(), and updateUpperBoundSums().

◆ ownVariables

boolean [] frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable, L extends LeafNode >.ownVariables

protected

Stores which are this variable's neighbours.

Referenced by addNewVariable(), and init().

◆ powersOf2

int [] frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable, L extends LeafNode >.powersOf2

protected

Pre-calculated powers of 2.

Referenced by createLeaf(), createLeaf(), and init().

◆ root

InnerNode<U, L> frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable, L extends LeafNode >.root

protected

The root of the tree.

Referenced by add(), compareWithHypercube(), getAmax(), getOwnVariableOptions(), hasMore(), InnerNodeTree(), InnerNodeTree(), isValuationSufficient(), pathExists(), removeAMax(), setChildDone(), setOldUB(), toString(), treeSize(), and updateLocalProblem().

◆ separatorSizePerChild

int [] frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable, L extends LeafNode >.separatorSizePerChild

protected

Stores the number of reported variables per child.

Referenced by add(), and init().

◆ serialVersionUID

final long frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable, L extends LeafNode >.serialVersionUID = 4206985864919963001L

staticprotected

Used for serialization.

◆ stillToSend

boolean frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable, L extends LeafNode >.stillToSend = true

protected

True if the domain information has not been requested yet.

Referenced by getFinalDomainSize(), and stillToSend().

◆ storeReceivedGoods

boolean frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable, L extends LeafNode >.storeReceivedGoods = true

protected

If domain or variable information is incomplete received goods must be stored, otherwise they can be discarded after processing.

Referenced by hasSupport().

◆ toBeProcessedDomains

HashMap<String, Val[]> frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable, L extends LeafNode >.toBeProcessedDomains

protected

Domains still to be added to domains.

Referenced by init().

◆ unpackedVariablesPerChild

String [][] frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable, L extends LeafNode >.unpackedVariablesPerChild

protected

Per child the unpacked variables (different from the reported variables).

Referenced by init().

◆ upperBoundIsInfiniteCounter

int frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable, L extends LeafNode >.upperBoundIsInfiniteCounter

protected

Counts the number of children that have already sent at least one confirmed good.

Referenced by add(), init(), and updateLocalProblem().

◆ upperBoundIsMinInfiniteCounter

int frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable, L extends LeafNode >.upperBoundIsMinInfiniteCounter

protected

COunts the number of children that have already reported a minInfinite value.

Referenced by init().

◆ upperBounds

U [] frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable, L extends LeafNode >.upperBounds

protected

For each child it stores that last confirmed utility received.

Referenced by add(), checkLeaf(), checkUpperBoundSums(), init(), and initializeUpperBoundSums().

◆ upperBoundSums

U [] frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable, L extends LeafNode >.upperBoundSums

protected

For every combination of children, this array contains the sum of upperBounds belonging to the selected children.

If there are n children, then this array contains n-1 elements (the empty set of children is 0)

Referenced by checkUpperBoundSums(), createLeaf(), createLeaf(), findMaxUB(), getAmax(), initializeUpperBoundSums(), initiateBounds(), setOldUB(), updateLocalProblem(), updatePath(), and updateUpperBoundSums().

◆ valuePointers

HashMap<String, HashMap<Val, Integer> > frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable, L extends LeafNode >.valuePointers

protected

Used to determine to which child a variable value corresponds to.

Referenced by add(), addNewVariable(), getOwnVariableOptions(), init(), pathExists(), toKey(), and updateLocalProblem().

◆ variableToDepth

HashMap<String, Integer> frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable, L extends LeafNode >.variableToDepth

protected

links a variable to its depth in the tree.

Referenced by add(), addNewVariable(), getBestAssignmentForOwnVariable(), init(), knowsVariable(), and toKey().

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

src/frodo2/algorithms/odpop/goodsTree/InnerNodeTreeFullDomain/InnerNodeTree.java

Classes

Public Member Functions

Protected Member Functions

Protected Attributes

Static Protected Attributes

Private Member Functions

Additional Inherited Members

Detailed Description

Constructor & Destructor Documentation

◆ InnerNodeTree() [1/6]

◆ InnerNodeTree() [2/6]

◆ InnerNodeTree() [3/6]

◆ InnerNodeTree() [4/6]

◆ InnerNodeTree() [5/6]

◆ InnerNodeTree() [6/6]

Member Function Documentation

◆ add()

◆ addNewVariable()

◆ addVariableToTree()

◆ checkLeaf()

◆ checkTree()

◆ checkUpperBoundSums()

◆ compareWithHypercube() [1/2]

◆ compareWithHypercube() [2/2]

◆ createInnerNode() [1/2]

◆ createInnerNode() [2/2]

◆ createIntArrayWrapper() [1/2]

◆ createIntArrayWrapper() [2/2]

◆ createLeaf() [1/2]

◆ createLeaf() [2/2]

◆ createPathNoUB()

◆ createPathWithUB()

◆ fillTree()

◆ finalDomainSizeReceiver()

◆ findMaxUB()

◆ generateAssignments()

◆ getAmax()

◆ getBestAssignmentForOwnVariable()

◆ getChildSeparatorReportingOrder()

◆ getChildSeparatorSize()

◆ getChildValues()

◆ getDomains()

◆ getFinalDomainSize()

◆ getOwnVariableOptions() [1/2]

◆ getOwnVariableOptions() [2/2]

◆ getUtilityLocalProblem()

◆ hasFullInfo()

◆ hasMore()

◆ hasSupport()

◆ init()

◆ initializeUpperBoundSums()

◆ initiateBounds()

◆ isValuationSufficient()

◆ knowsVariable()

◆ localPathAlive()

◆ notEnoughInfo()

◆ pathAlive()

◆ pathExists()

◆ recalculateUB()

◆ removeAMax()

◆ removeInconsistencies()

◆ removePath()

◆ setChildDone()

◆ setChildrenSeparator()

◆ setFinalDomainSize()

◆ setOldUB()

◆ stillToSend()

◆ toKey()

◆ toString()

◆ treeSize() [1/2]

◆ treeSize() [2/2]

◆ UBexists()

◆ updateLocalProblem()

◆ updatePath()

◆ updateUpperBoundSums()

◆ upperBoundChangesUtil()

◆ Utilexists()

Member Data Documentation

◆ branchingFactor

◆ childrenVariables