FRODO Version 2.19.1
An open-source framework for Distributed Constraint Optimization (DCOP)
Loading...
Searching...
No Matches
frodo2.algorithms.varOrdering.linear.LinearOrdering< V extends Addable< V >, U extends Addable< U > >.MaxWidthMinDom Class Reference

A heuristic that maximizes the number of neighbors already in the order, breaking ties by minimizing the domain size, and then by variable name. More...

Inheritance diagram for frodo2.algorithms.varOrdering.linear.LinearOrdering< V extends Addable< V >, U extends Addable< U > >.MaxWidthMinDom:

Classes

class  IntIntStringTuple
 An (int, int, String) tuple. More...

Public Member Functions

 MaxWidthMinDom (DCOPProblemInterface<?, ?> problem)
 Constructor.
IntIntStringTuple getScore (List< String > order, String var)
Public Member Functions inherited from frodo2.algorithms.varOrdering.linear.LinearOrdering< V extends Addable< V >, U extends Addable< U > >.Heuristic< IntIntStringTuple >
getScore (List< String > order, String var)
 Computes the score of a given variable.

Private Attributes

DCOPProblemInterface<?, ?> problem
 The agent's subproblem.

Detailed Description

A heuristic that maximizes the number of neighbors already in the order, breaking ties by minimizing the domain size, and then by variable name.

Constructor & Destructor Documentation

◆ MaxWidthMinDom()

frodo2.algorithms.varOrdering.linear.LinearOrdering< V extends Addable< V >, U extends Addable< U > >.MaxWidthMinDom.MaxWidthMinDom ( DCOPProblemInterface<?, ?> problem)

Constructor.

Parameters
problemthe agent's subproblem

References problem.

Member Function Documentation

◆ getScore()

Member Data Documentation

◆ problem

DCOPProblemInterface<?, ?> frodo2.algorithms.varOrdering.linear.LinearOrdering< V extends Addable< V >, U extends Addable< U > >.MaxWidthMinDom.problem
private

The agent's subproblem.

Referenced by MaxWidthMinDom().


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