frodo2.algorithms.heuristics.MostConnectedHeuristic Class Reference

A ScoringHeuristic in which the score for a variable is its number of neighbors. More...

Inheritance diagram for frodo2.algorithms.heuristics.MostConnectedHeuristic:

Public Member Functions
	MostConnectedHeuristic (DCOPProblemInterface<?, ?> problem, Element params)
	Constructor.
Map< String, Short >	getScores ()
Public Member Functions inherited from frodo2.algorithms.heuristics.ScoringHeuristic< Short >
Map< String, S >	getScores ()

Private Attributes
DCOPProblemInterface<?, ?>	problem
	The agent's problem.

Detailed Description

A ScoringHeuristic in which the score for a variable is its number of neighbors.

Author

Thomas Leaute

Constructor & Destructor Documentation

MostConnectedHeuristic()

frodo2.algorithms.heuristics.MostConnectedHeuristic.MostConnectedHeuristic	(	DCOPProblemInterface<?, ?>	problem,
		Element	params )

Constructor.

Parameters

problem	The agent's problem
params	unused

References problem.

Member Function Documentation

getScores()

Map< String, Short > frodo2.algorithms.heuristics.MostConnectedHeuristic.getScores

(

)

See also

ScoringHeuristic.getScores()

Member Data Documentation

problem

DCOPProblemInterface<?, ?> frodo2.algorithms.heuristics.MostConnectedHeuristic.problem

private

The agent's problem.

Referenced by MostConnectedHeuristic().

---

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

• src/frodo2/algorithms/heuristics/MostConnectedHeuristic.java