FRODO Version 2.19.1
An open-source framework for Distributed Constraint Optimization (DCOP)
Loading...
Searching...
No Matches
frodo2.algorithms.dpop.memory.MemoryBoundedUTIL< V extends Addable< V >, U extends Addable< U > >.VarInfo Class Reference

The information about a given variable. More...

Inheritance diagram for frodo2.algorithms.dpop.memory.MemoryBoundedUTIL< V extends Addable< V >, U extends Addable< U > >.VarInfo:

Private Attributes

HashMap< String, V[]> ccs
 The set of cycle-cutset variables (with their domains) in the cluster rooted at the variable; if empty, the variable is not the CR; if null, the variable is not part of any cluster.
Iterator< V, U > iter
 The iterator over the cycle-cutset variables.
HashMap< String, HashSet< String > > ccsByChild = new HashMap< String, HashSet<String> > ()
 The CC list sent by each child variable.
String[] context
 The ordered CC variables.
V[] contextValues
 The current values of the CC variables.
UtilitySolutionSpace< V, U > sliceIn
 The join of all sliced UTIL messages revieved from cluster children.
ProjOutput< V, U > projOutput
 A CR's "cache" that stores the CR's constantly updated output UTIL message.
V[] sepValues
 An assignment to my separator.
boolean lastUTIL = false
 Whether this is the last UTIL propagation phase, and optimal conditional assignments must be computed instead of performing a blind projection.

Additional Inherited Members

Public Member Functions inherited from frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable< U > >.ClusterInfo
 ClusterInfo ()
 Constructor.
String toString ()
Public Attributes inherited from frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable< U > >.ClusterInfo
String id
 This cluster's ID.
String[] vars
 The variables this info corresponds to.
String parent = null
 The parent variable of this cluster (or null if this variable is a root).
String parentAgent = null
 The parent agent of this cluster (or null if this variable is a root).
int nbrChildren = 0
 The number of children variables.
int nbrUTIL = 0
 The number of UTIL messages received for this cluster so far.
LinkedList< UtilitySolutionSpace< Val, U > > spaces = new LinkedList< UtilitySolutionSpace<Val, U> > ()
 A list of spaces received for this cluster so far.

Detailed Description

The information about a given variable.

Member Data Documentation

◆ ccs

HashMap<String, V[]> frodo2.algorithms.dpop.memory.MemoryBoundedUTIL< V extends Addable< V >, U extends Addable< U > >.VarInfo.ccs
private

The set of cycle-cutset variables (with their domains) in the cluster rooted at the variable; if empty, the variable is not the CR; if null, the variable is not part of any cluster.

Referenced by frodo2.algorithms.dpop.memory.MemoryBoundedUTIL< V extends Addable< V >, U extends Addable< U > >.notifyIn(), and frodo2.algorithms.dpop.memory.MemoryBoundedUTIL< V extends Addable< V >, U extends Addable< U > >.projectAndSend().

◆ ccsByChild

◆ context

◆ contextValues

◆ iter

◆ lastUTIL

boolean frodo2.algorithms.dpop.memory.MemoryBoundedUTIL< V extends Addable< V >, U extends Addable< U > >.VarInfo.lastUTIL = false
private

Whether this is the last UTIL propagation phase, and optimal conditional assignments must be computed instead of performing a blind projection.

Referenced by frodo2.algorithms.dpop.memory.MemoryBoundedUTIL< V extends Addable< V >, U extends Addable< U > >.notifyIn(), and frodo2.algorithms.dpop.memory.MemoryBoundedUTIL< V extends Addable< V >, U extends Addable< U > >.projectAndSend().

◆ projOutput

◆ sepValues

◆ sliceIn


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