FRODO Version 2.19.1
An open-source framework for Distributed Constraint Optimization (DCOP)
Loading...
Searching...
No Matches
frodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable< U > >.IteratorBestFirst< V, U > Interface Template Reference

A BasicUtilitySolutionSpace iterator that returns items in a best first order. More...

Inheritance diagram for frodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable< U > >.IteratorBestFirst< V, U >:

Public Member Functions

maximalCut ()
Public Member Functions inherited from frodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable< U > >.SparseIterator< V, U >
nextUtility (U bound, boolean minimize)
 Returns the next solution strictly better than the input bound.
getCurrentUtility (U bound, boolean minimize)
Public Member Functions inherited from frodo2.solutionSpaces.BasicUtilitySolutionSpace< V extends Addable< V >, U extends Serializable >.SparseIterator< V, U >
nextUtility ()
getCurrentUtility ()
void setCurrentUtility (U util)
 Sets the utility of the current solution.
Public Member Functions inherited from frodo2.solutionSpaces.SolutionSpace< V extends Addable< V > >.SparseIterator< V >
V[] nextSolution ()
V[] getCurrentSolution ()
String[] getVariablesOrder ()
V[][] getDomains ()
void update ()
 It is supposed to be called if the solution space upon which the iterator is based has changed.
Public Member Functions inherited from frodo2.solutionSpaces.SolutionSpace< V extends Addable< V > >.Iterator< V >
long getNbrSolutions ()
boolean hasNext ()

Detailed Description

A BasicUtilitySolutionSpace iterator that returns items in a best first order.

Author
Brammert Ottens, 27 jan. 2011
Parameters
<V>the type used for variable values
<U>the type used for utility values

Member Function Documentation

◆ maximalCut()


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