FRODO Version 2.19.1
An open-source framework for Distributed Constraint Optimization (DCOP)
Loading...
Searching...
No Matches
frodo2.solutionSpaces.hypercube.HyperCubeIterBestFirst< V extends Addable< V >, U extends Addable< U > > Member List

This is the complete list of members for frodo2.solutionSpaces.hypercube.HyperCubeIterBestFirst< V extends Addable< V >, U extends Addable< U > >, including all inherited members.

getCurrentSolution()frodo2.solutionSpaces.SolutionSpace< V extends Addable< V > >.SparseIterator< V >
frodo2::solutionSpaces::hypercube::HypercubeIter< V, U >.getCurrentUtility(U bound, final boolean minimize)frodo2.solutionSpaces.hypercube.HypercubeIter< V, U >
frodo2::solutionSpaces::UtilitySolutionSpace::IteratorBestFirst.getCurrentUtility(U bound, boolean minimize)frodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable< U > >.SparseIterator< V, U >
frodo2::solutionSpaces::BasicUtilitySolutionSpace::SparseIterator.getCurrentUtility()frodo2.solutionSpaces.BasicUtilitySolutionSpace< V extends Addable< V >, U extends Serializable >.SparseIterator< V, U >
getDomains()frodo2.solutionSpaces.SolutionSpace< V extends Addable< V > >.SparseIterator< V >
getNbrSolutions()frodo2.solutionSpaces.SolutionSpace< V extends Addable< V > >.Iterator< V >
getVariablesOrder()frodo2.solutionSpaces.SolutionSpace< V extends Addable< V > >.SparseIterator< V >
hasNext()frodo2.solutionSpaces.SolutionSpace< V extends Addable< V > >.Iterator< V >
HypercubeIter()frodo2.solutionSpaces.hypercube.HypercubeIter< V, U >
HyperCubeIterBestFirst(BasicHypercube< V, U > space, boolean maximize)frodo2.solutionSpaces.hypercube.HyperCubeIterBestFirst< V extends Addable< V >, U extends Addable< U > >
indexStepsfrodo2.solutionSpaces.hypercube.HyperCubeIterBestFirst< V extends Addable< V >, U extends Addable< U > >private
indexToAssignment(int index)frodo2.solutionSpaces.hypercube.HyperCubeIterBestFirst< V extends Addable< V >, U extends Addable< U > >private
maximalCut()frodo2.solutionSpaces.hypercube.HyperCubeIterBestFirst< V extends Addable< V >, U extends Addable< U > >
nextSolution()frodo2.solutionSpaces.hypercube.HyperCubeIterBestFirst< V extends Addable< V >, U extends Addable< U > >
nextUtility()frodo2.solutionSpaces.hypercube.HyperCubeIterBestFirst< V extends Addable< V >, U extends Addable< U > >
frodo2::solutionSpaces::hypercube::HypercubeIter< V, U >.nextUtility(U bound, final boolean minimize)frodo2.solutionSpaces.hypercube.HypercubeIter< V, U >
frodo2::solutionSpaces::UtilitySolutionSpace::IteratorBestFirst.nextUtility(U bound, boolean minimize)frodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable< U > >.SparseIterator< V, U >
orderedAssignmentsfrodo2.solutionSpaces.hypercube.HyperCubeIterBestFirst< V extends Addable< V >, U extends Addable< U > >private
setCurrentUtility(U util)frodo2.solutionSpaces.hypercube.HyperCubeIterBestFirst< V extends Addable< V >, U extends Addable< U > >
update()frodo2.solutionSpaces.SolutionSpace< V extends Addable< V > >.SparseIterator< V >