Uses of Class
org.ddolib.examples.lcs.LCSState

Packages that use LCSState

Package	Description
org.ddolib.examples.lcs	This package implements the acs, astar and ddo models for the Longest Common Subsequence (LCS) Problem.

Uses of LCSState in org.ddolib.examples.lcs

Methods in org.ddolib.examples.lcs that return LCSState

Modifier and Type	Method	Description
LCSState	LCSProblem.initialState()
LCSState	LCSRelax.mergeStates(Iterator<LCSState> states)	Merges multiple LCS states into a single relaxed state.
LCSState	LCSProblem.transition(LCSState state, Decision decision)	Computes the next state resulting from applying a decision at the current state.

Methods in org.ddolib.examples.lcs with parameters of type LCSState

Modifier and Type	Method	Description
int	LCSRanking.compare(LCSState state1, LCSState state2)	Compares two LCS states.
Iterator<Integer>	LCSProblem.domain(LCSState state, int var)	Computes the domain of possible next decisions (characters) for a given state.
double	LCSFastLowerBound.fastLowerBound(LCSState state, Set<Integer> variables)	Computes a fast lower bound on the objective function for the given state.
double	LCSRelax.relaxEdge(LCSState from, LCSState to, LCSState merged, Decision d, double cost)	Relaxes the cost of a transition between two LCS states.
LCSState	LCSProblem.transition(LCSState state, Decision decision)	Computes the next state resulting from applying a decision at the current state.
double	LCSProblem.transitionCost(LCSState state, Decision decision)	Computes the transition cost of a decision from the current state.

Method parameters in org.ddolib.examples.lcs with type arguments of type LCSState

Modifier and Type	Method	Description
LCSState	LCSRelax.mergeStates(Iterator<LCSState> states)	Merges multiple LCS states into a single relaxed state.