CostBased

org.ddolibscala.tools.ddo.heuristics.cluster.CostBased
object CostBased

This strategy select the nodes based on the objective value of the best path leading to them. It requires a problem-specific StateRanking comparator to break the ties between nodes of same cost.

Attributes

See also
Graph
Supertypes
class Object
trait Matchable
class Any
Self type
CostBased.type

Members list

Value members

Concrete methods

def apply[T](ranking: StateRanking[T]): CostBased[T]

Constructs a cost-based reduction strategy with a given state ranking

Constructs a cost-based reduction strategy with a given state ranking

Type parameters

T

the type of states in the decision diagram

Value parameters

ranking

the problem specific state-ranking comparator used to break the ties between nodes of same cost.

Attributes

Returns

a cost-based reduction strategy