| AbstractProblem() | frodo2.algorithms.AbstractProblem< V, U > | protected |
| addAgent(String agent) | frodo2.algorithms.AbstractProblem< V, U > | |
| addProbabilitySpace(String randVar, UtilitySolutionSpace< V, U > prob) | frodo2.algorithms.Problem< V extends Addable< V >, U extends Addable< U > > | |
| addRandomVar(String name, V[] domain) | frodo2.algorithms.Problem< V extends Addable< V >, U extends Addable< U > > | |
| addSolutionSpace(UtilitySolutionSpace< V, U > space) | frodo2.algorithms.Problem< V extends Addable< V >, U extends Addable< U > > | |
| addUnarySpace(String name, String var, V[] dom, U[] utils) | frodo2.algorithms.AbstractProblem< V, U > | |
| addVariable(String name, String owner, String domain) | frodo2.algorithms.Problem< V extends Addable< V >, U extends Addable< U > > | |
| addVariable(String name, String owner, V[] domain) | frodo2.algorithms.Problem< V extends Addable< V >, U extends Addable< U > > | |
| agentName | frodo2.algorithms.AbstractProblem< V, U > | protected |
| agents | frodo2.algorithms.AbstractProblem< V, U > | protected |
| domains | frodo2.algorithms.AbstractProblem< V, U > | protected |
| domClass | frodo2.algorithms.Problem< V extends Addable< V >, U extends Addable< U > > | private |
| extendedRandNeighborhoods | frodo2.algorithms.AbstractProblem< V, U > | protected |
| getAgent() | frodo2.algorithms.AbstractProblem< V, U > | |
| getAgentNeighborhoods() | frodo2.algorithms.AbstractProblem< V, U > | |
| getAgentNeighbors(String var) | frodo2.algorithms.AbstractProblem< V, U > | private |
| getAgents() | frodo2.algorithms.AbstractProblem< V, U > | |
| getAllVars() | frodo2.algorithms.AbstractProblem< V, U > | |
| getAnonymNeighborhoods() | frodo2.algorithms.AbstractProblem< V, U > | |
| getAnonymVars() | frodo2.algorithms.AbstractProblem< V, U > | |
| getDomain(String var) | frodo2.algorithms.AbstractProblem< V, U > | |
| getDomainSize(String var) | frodo2.algorithms.AbstractProblem< V, U > | |
| getDomClass() | frodo2.algorithms.Problem< V extends Addable< V >, U extends Addable< U > > | |
| getExpectedUtility(Map< String, V > assignments) | frodo2.algorithms.Problem< V extends Addable< V >, U extends Addable< U > > | |
| getExtVars() | frodo2.algorithms.Problem< V extends Addable< V >, U extends Addable< U > > | |
| getInfeasibleUtil() | frodo2.algorithms.AbstractProblem< V, U > | protected |
| getMinInfUtility() | frodo2.algorithms.AbstractProblem< V, U > | |
| getMyVars() | frodo2.algorithms.AbstractProblem< V, U > | |
| getNbrIntVars() | frodo2.algorithms.AbstractProblem< V, U > | |
| getNbrNeighbors(String var) | frodo2.algorithms.AbstractProblem< V, U > | |
| getNbrVars() | frodo2.algorithms.AbstractProblem< V, U > | |
| getNCCCs() | frodo2.algorithms.Problem< V extends Addable< V >, U extends Addable< U > > | |
| getNeighborhoods() | frodo2.algorithms.AbstractProblem< V, U > | |
| getNeighborhoodSizes() | frodo2.algorithms.AbstractProblem< V, U > | |
| getNeighborVars(String var) | frodo2.algorithms.AbstractProblem< V, U > | |
| getNumberOfCoordinationConstraints() | frodo2.algorithms.AbstractProblem< V, U > | |
| getOwner(String var) | frodo2.algorithms.AbstractProblem< V, U > | |
| getOwners() | frodo2.algorithms.AbstractProblem< V, U > | |
| getParamUtility(Map< String[], BasicUtilitySolutionSpace< V, ArrayList< V > > > assignments) | frodo2.algorithms.Problem< V extends Addable< V >, U extends Addable< U > > | |
| getPlusInfUtility() | frodo2.algorithms.AbstractProblem< V, U > | |
| getProbabilitySpacePerRandVar() | frodo2.algorithms.Problem< V extends Addable< V >, U extends Addable< U > > | |
| getProbabilitySpaces() | frodo2.algorithms.Problem< V extends Addable< V >, U extends Addable< U > > | |
| getProbabilitySpaces(String var) | frodo2.algorithms.Problem< V extends Addable< V >, U extends Addable< U > > | |
| getRandVars() | frodo2.algorithms.AbstractProblem< V, U > | |
| getScope(String var) | frodo2.algorithms.AbstractProblem< V, U > | protected |
| getSolutionSpaces() | frodo2.algorithms.AbstractProblem< V, U > | |
| getSubProblem(String agent) | frodo2.algorithms.Problem< V extends Addable< V >, U extends Addable< U > > | |
| getUtilClass() | frodo2.algorithms.AbstractProblem< V, U > | |
| getUtility(Map< String, V > assignments, boolean withAnonymVars) | frodo2.algorithms.Problem< V extends Addable< V >, U extends Addable< U > > | |
| frodo2::algorithms::AbstractProblem< V, U >.getUtility(Map< String, V > assignments) | frodo2.algorithms.AbstractProblem< V, U > | |
| getVariables(final String owner) | frodo2.algorithms.AbstractProblem< V, U > | |
| getVarScopes() | frodo2.algorithms.AbstractProblem< V, U > | |
| getZeroUtility() | frodo2.algorithms.AbstractProblem< V, U > | |
| ground(String var, V val) | frodo2.algorithms.Problem< V extends Addable< V >, U extends Addable< U > > | |
| incrNCCCs(long incr) | frodo2.algorithms.Problem< V extends Addable< V >, U extends Addable< U > > | |
| isRandom(String var) | frodo2.algorithms.AbstractProblem< V, U > | |
| maximize | frodo2.algorithms.AbstractProblem< V, U > | protected |
| mpc | frodo2.algorithms.AbstractProblem< V, U > | protected |
| multipleTypes() | frodo2.algorithms.Problem< V extends Addable< V >, U extends Addable< U > > | |
| ncccCount | frodo2.algorithms.Problem< V extends Addable< V >, U extends Addable< U > > | private |
| owners | frodo2.algorithms.AbstractProblem< V, U > | protected |
| Problem(boolean maximize) | frodo2.algorithms.Problem< V extends Addable< V >, U extends Addable< U > > | |
| Problem(boolean maximize, boolean publicAgents, boolean mpc, boolean extendedRandNeighborhoods) | frodo2.algorithms.Problem< V extends Addable< V >, U extends Addable< U > > | |
| Problem(String agentName, Set< String > agents, Map< String, String > owners, Map< String, V[]> domains, Set< String > randVars, List< ? extends UtilitySolutionSpace< V, U > > spaces, Map< String, ? extends UtilitySolutionSpace< V, U > > probSpaces, Map< String, Set< String > > varScopes, Class< V > domClass, Class< U > utilClass) | frodo2.algorithms.Problem< V extends Addable< V >, U extends Addable< U > > | |
| Problem(String agentName, Set< String > agents, Map< String, String > owners, Map< String, V[]> domains, Set< String > randVars, List< ? extends UtilitySolutionSpace< V, U > > spaces, Map< String, ? extends UtilitySolutionSpace< V, U > > probSpaces, Map< String, Set< String > > varScopes, Class< V > domClass, Class< U > utilClass, boolean maximize) | frodo2.algorithms.Problem< V extends Addable< V >, U extends Addable< U > > | |
| probSpaces | frodo2.algorithms.Problem< V extends Addable< V >, U extends Addable< U > > | private |
| publicAgents | frodo2.algorithms.AbstractProblem< V, U > | protected |
| randVars | frodo2.algorithms.AbstractProblem< V, U > | protected |
| removeSpace(String name) | frodo2.algorithms.Problem< V extends Addable< V >, U extends Addable< U > > | |
| rescale(U multiply, U add) | frodo2.algorithms.Problem< V extends Addable< V >, U extends Addable< U > > | |
| reset(ProblemInterface< V, U > newProblem) | frodo2.algorithms.Problem< V extends Addable< V >, U extends Addable< U > > | |
| reset(String agentName, Set< String > agents, Map< String, String > owners, Map< String, V[]> domains, Set< String > randVars, List< ? extends UtilitySolutionSpace< V, U > > spaces, Map< String, ? extends UtilitySolutionSpace< V, U > > probSpaces, Map< String, Set< String > > varScopes, Class< V > domClass, Class< U > utilClass, boolean maximize) | frodo2.algorithms.Problem< V extends Addable< V >, U extends Addable< U > > | |
| serialVersionUID | frodo2.algorithms.Problem< V extends Addable< V >, U extends Addable< U > > | privatestatic |
| setAgent(String agent) | frodo2.algorithms.Problem< V extends Addable< V >, U extends Addable< U > > | |
| setDomain(String var, V[] dom) | frodo2.algorithms.Problem< V extends Addable< V >, U extends Addable< U > > | |
| setDomain(String var, ArrayList< V > domain, Map< V, Double > weights) | frodo2.algorithms.Problem< V extends Addable< V >, U extends Addable< U > > | private |
| setDomClass(Class< V > domClass) | frodo2.algorithms.Problem< V extends Addable< V >, U extends Addable< U > > | |
| setMaximize(final boolean maximize) | frodo2.algorithms.AbstractProblem< V, U > | |
| setNCCCs(long ncccs) | frodo2.algorithms.Problem< V extends Addable< V >, U extends Addable< U > > | |
| setOwner(String var, String owner) | frodo2.algorithms.Problem< V extends Addable< V >, U extends Addable< U > > | |
| setProbSpace(String var, Map< V, Double > prob) | frodo2.algorithms.Problem< V extends Addable< V >, U extends Addable< U > > | |
| setUtilClass(Class< U > utilClass) | frodo2.algorithms.AbstractProblem< V, U > | |
| setVarScope(String var, Set< String > scope) | frodo2.algorithms.AbstractProblem< V, U > | protected |
| spaces | frodo2.algorithms.AbstractProblem< V, U > | protected |
| toString() | frodo2.algorithms.Problem< V extends Addable< V >, U extends Addable< U > > | |
| utilClass | frodo2.algorithms.AbstractProblem< V, U > | protected |
| varScopes | frodo2.algorithms.AbstractProblem< V, U > | protected |
1.15.0