frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.Node< U extends Addable< U > > Class Template Reference

Class for every node in the GoodsTree. More...

Public Member Functions
	Node ()
	A constructor.
Node< U >	makeDummyCopy ()
	Method used when creating a dummy part of the tree.
boolean	isAlive ()
void	setAlive (boolean alive)
	Change the alive status of this node.
boolean	utilCandidate (U maxUtil, final boolean maximize)
boolean	ubCandidate (U maxUB, boolean maximize)
U	getUtil ()
U	getUB ()
boolean	hasUtil ()
boolean	hasUB ()
boolean	recalculateUtil ()

Public Attributes
boolean	alive
	False if this node leads to a path that has been deleted.

Package Functions
public< L extends Node< U > > L	newInstance (int confirmedCounter, int[] powersOf2)
	Create a new instance of the leaf node.
public< L extends Node< U > > L	newInstance (int confirmedCounter, U util, int[] powersOf2)
	Create a new instance of the leaf node.

Detailed Description

Class for every node in the GoodsTree.

Author

brammert

Parameters

<U>	the type used to represent a utility value

Constructor & Destructor Documentation

Node()

frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.Node< U extends Addable< U > >.Node

(

)

A constructor.

Referenced by makeDummyCopy().

Member Function Documentation

getUB()

U frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.Node< U extends Addable< U > >.getUB

(

)

Author

Brammert Ottens, 22 apr 2010

Returns

the upper bound of this node

getUtil()

U frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.Node< U extends Addable< U > >.getUtil

(

)

Author

Brammert Ottens, 22 apr 2010

Returns

the utility of this node

Referenced by frodo2.algorithms.odpop.goodsTree.InnerNodeTree.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >.createPathNoUB(), and frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >.createPathNoUB().

hasUB()

boolean frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.Node< U extends Addable< U > >.hasUB

(

)

Author

Brammert Ottens, 22 apr 2010

Returns

true when this node has an upper bound

Referenced by frodo2.algorithms.odpop.goodsTree.InnerNodeTree.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >.removeDummies().

hasUtil()

boolean frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.Node< U extends Addable< U > >.hasUtil

(

)

Author

Brammert Ottens, 22 apr 2010

Returns

true when this node has a utility

isAlive()

boolean frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.Node< U extends Addable< U > >.isAlive

(

)

Author

Brammert Ottens, 30 sep 2009

Returns

true when this node is still alive, and false otherwise

References alive.

Referenced by frodo2.algorithms.asodpop.goodsTree.innerNodeTree.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U > >.checkGood(), frodo2.algorithms.asodpop.goodsTree.innerNodeTreeBinaryDomains.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U > >.checkGood(), frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >.findMaxUB(), frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >.recalculateUB(), frodo2.algorithms.odpop.goodsTree.InnerNodeTree.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >.removeDummies(), and frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >.removePath().

makeDummyCopy()

Node< U > frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.Node< U extends Addable< U > >.makeDummyCopy

(

)

Method used when creating a dummy part of the tree.

We are only interested in the UB

Returns

a shallow copy of this node

References Node().

Here is the call graph for this function:

newInstance() [1/2]

public< L extends Node< U > > L frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.Node< U extends Addable< U > >.newInstance ( int confirmedCounter, int[] powersOf2 )

package

Create a new instance of the leaf node.

Author

Brammert Ottens, 1 july 2009

Parameters

<L>	the class used for leaf nodes
confirmedCounter	the number of children of this leaf node
powersOf2	precomputed powers of 2

Returns

a new leaf node

Referenced by frodo2.algorithms.odpop.goodsTree.InnerNodeTree.InnerNode< U extends Addable< U >, L extends LeafNode< U > >.removeDummy().

newInstance() [2/2]

public< L extends Node< U > > L frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.Node< U extends Addable< U > >.newInstance ( int confirmedCounter, U util, int[] powersOf2 )

package

Create a new instance of the leaf node.

Author

Brammert Ottens, 1 july 2009

Parameters

<L>	the class used for leaf nodes
confirmedCounter	the number of children of this leaf node
util	the utility of the local problem
powersOf2	precomputed powers of 2

Returns

a new leaf node

recalculateUtil()

boolean frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.Node< U extends Addable< U > >.recalculateUtil

(

)

Author

Brammert Ottens, 22 apr 2010

Returns

true when it makes sense to recalculate the utility of this node

setAlive()

void frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.Node< U extends Addable< U > >.setAlive

(

boolean

alive

)

Change the alive status of this node.

Author

Brammert Ottens, 30 sep 2009

Parameters

alive

true when this node is alive, and false otherwise

References alive.

ubCandidate()

boolean frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.Node< U extends Addable< U > >.ubCandidate	(	U	maxUB,
		boolean	maximize )

Author

Brammert Ottens, 20 apr 2010

Parameters

maxUB	the maximal upper bound found so far
maximize	when true we are maximizing, otherwise we are minimizing

Returns

true when this node can be looked upon as a candidate for the maximal upper bound of the subtree rooted at his parent

utilCandidate()

boolean frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.Node< U extends Addable< U > >.utilCandidate	(	U	maxUtil,
		final boolean	maximize )

Author

Brammert Ottens, 20 apr 2010

Parameters

maxUtil	the maximal utility found so far
maximize	when true we are maximizing, otherwise we are minimizing

Returns

true when this node can be looked upon as a candidate for the maximal utility of the subtree rooted at his parent

Referenced by frodo2.algorithms.odpop.goodsTree.InnerNodeTree.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >.createPathNoUB(), and frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.InnerNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends LeafNode< U > >.createPathNoUB().

Member Data Documentation

alive

boolean frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.Node< U extends Addable< U > >.alive

False if this node leads to a path that has been deleted.

Referenced by isAlive(), and setAlive().

---

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

• src/frodo2/algorithms/odpop/goodsTree/InnerNodeTreeFullDomain/Node.java