FRODO Version 2.19.1
An open-source framework for Distributed Constraint Optimization (DCOP)
Loading...
Searching...
No Matches
frodo2.algorithms.asodpop.goodsTree.leafNodeTree.LeafNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.Node< U > > Member List

This is the complete list of members for frodo2.algorithms.asodpop.goodsTree.leafNodeTree.LeafNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.Node< U > >, including all inherited members.

add(Good< Val, U > g, int sender, HashMap< String, Val[]> domains)frodo2.algorithms.odpop.goodsTree.leafNodeTree.LeafNodeTree< Val, U, L >
addToTree(Val[] assignment, int depth, Node currentNode)frodo2.algorithms.odpop.goodsTree.leafNodeTree.LeafNodeTree< Val, U, L >protected
domainSizefrodo2.algorithms.odpop.goodsTree.leafNodeTree.LeafNodeTree< Val, U, L >protected
fillOwnOptions(U[] ownOptions, int currentVariable, String[] localVariables, Val[] assignment)frodo2.algorithms.asodpop.goodsTree.leafNodeTree.LeafNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.Node< U > >private
getAmax()frodo2.algorithms.asodpop.goodsTree.leafNodeTree.LeafNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.Node< U > >
getBestAssignmentForOwnVariable(HashMap< String, Val > context)frodo2.algorithms.odpop.goodsTree.leafNodeTree.LeafNodeTree< Val, U, L >
getChildSeparatorReportingOrder(int child)frodo2.algorithms.odpop.goodsTree.leafNodeTree.LeafNodeTree< Val, U, L >
getChildValues(HashMap< String, Val > parentContext, int child)frodo2.algorithms.odpop.goodsTree.leafNodeTree.LeafNodeTree< Val, U, L >
getDomains()frodo2.algorithms.odpop.goodsTree.leafNodeTree.LeafNodeTree< Val, U, L >
getFinalDomainSize()frodo2.algorithms.odpop.goodsTree.leafNodeTree.LeafNodeTree< Val, U, L >
getOwnAssignment(HashMap< String, Val > assignment, Node currentNode, int depth)frodo2.algorithms.asodpop.goodsTree.leafNodeTree.LeafNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.Node< U > >protected
hasFullInfo()frodo2.algorithms.odpop.goodsTree.leafNodeTree.LeafNodeTree< Val, U, L >
hasMorefrodo2.algorithms.odpop.goodsTree.leafNodeTree.LeafNodeTree< Val, U, L >protected
init(U zero)frodo2.algorithms.odpop.goodsTree.leafNodeTree.LeafNodeTree< Val, U, L >private
isValuationSufficient()frodo2.algorithms.odpop.goodsTree.leafNodeTree.LeafNodeTree< Val, U, L >
knowsVariable(String variable)frodo2.algorithms.odpop.goodsTree.leafNodeTree.LeafNodeTree< Val, U, L >
LeafNodeTree(String ownVariable, Val[] ownVariableDomain, UtilitySolutionSpace< Val, U > space, U zero, U infeasibleUtil, boolean maximize, boolean collectStats)frodo2.algorithms.asodpop.goodsTree.leafNodeTree.LeafNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.Node< U > >
LeafNodeTree(String ownVariable, Val[] ownVariableDomain, List< UtilitySolutionSpace< Val, U > > spaces, U zero, U infeasibleUtil, boolean maximize, boolean collectStats)frodo2.algorithms.asodpop.goodsTree.leafNodeTree.LeafNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.Node< U > >
localAssignmentfrodo2.algorithms.odpop.goodsTree.leafNodeTree.LeafNodeTree< Val, U, L >protected
notEnoughInfo()frodo2.algorithms.odpop.goodsTree.leafNodeTree.LeafNodeTree< Val, U, L >
pathExists(Val[] values)frodo2.algorithms.odpop.goodsTree.leafNodeTree.LeafNodeTree< Val, U, L >
removeAMax()frodo2.algorithms.odpop.goodsTree.leafNodeTree.LeafNodeTree< Val, U, L >
rootfrodo2.algorithms.odpop.goodsTree.leafNodeTree.LeafNodeTree< Val, U, L >protected
separatorVariablesfrodo2.algorithms.odpop.goodsTree.leafNodeTree.LeafNodeTree< Val, U, L >protected
serialVersionUIDfrodo2.algorithms.asodpop.goodsTree.leafNodeTree.LeafNodeTree< Val extends Addable< Val >, U extends Addable< U >, L extends frodo2.algorithms.odpop.goodsTree.InnerNodeTreeFullDomain.Node< U > >privatestatic
setChildDone(int child)frodo2.algorithms.odpop.goodsTree.leafNodeTree.LeafNodeTree< Val, U, L >
setChildrenSeparator(int child, String[] variables)frodo2.algorithms.odpop.goodsTree.leafNodeTree.LeafNodeTree< Val, U, L >
setFinalDomainSize(String[] variables, int[] domainSize)frodo2.algorithms.odpop.goodsTree.leafNodeTree.LeafNodeTree< Val, U, L >
singletonfrodo2.algorithms.odpop.goodsTree.leafNodeTree.LeafNodeTree< Val, U, L >protected
stillToSendfrodo2.algorithms.odpop.goodsTree.leafNodeTree.LeafNodeTree< Val, U, L >private
valuePointersfrodo2.algorithms.odpop.goodsTree.leafNodeTree.LeafNodeTree< Val, U, L >protected
variableToDepthfrodo2.algorithms.odpop.goodsTree.leafNodeTree.LeafNodeTree< Val, U, L >private