Uses of Class
org.ddolib.examples.tsp.TSPState

Packages that use TSPState

Package	Description
org.ddolib.examples.tsp	This package implements the acs, astar and ddo models for the Traveling Salesman Problem (TSP).

Uses of TSPState in org.ddolib.examples.tsp

Methods in org.ddolib.examples.tsp that return TSPState

Modifier and Type	Method	Description
TSPState	TSPProblem.initialState()	Returns the initial state for a search algorithm.
TSPState	TSPRelax.mergeStates(Iterator<TSPState> states)	Merges multiple TSPState instances into a single relaxed state.
TSPState	TSPProblem.transition(TSPState state, Decision decision)	Computes the next state after making a decision from the current state.

Methods in org.ddolib.examples.tsp with parameters of type TSPState

Modifier and Type	Method	Description
int	TSPRanking.compare(TSPState o1, TSPState o2)	Compares two TSP states.
Iterator<Integer>	TSPProblem.domain(TSPState state, int var)	Returns the domain of possible decisions for a given state and variable index.
double	TSPFastLowerBound.fastLowerBound(TSPState state, Set<Integer> unassignedVariables)	Computes a fast lower bound on the cost to complete the TSP tour from the given state.
double	TSPRelax.relaxEdge(TSPState from, TSPState to, TSPState merged, Decision d, double cost)	Relaxes the cost of a transition between states.
TSPState	TSPProblem.transition(TSPState state, Decision decision)	Computes the next state after making a decision from the current state.
double	TSPProblem.transitionCost(TSPState state, Decision decision)	Computes the transition cost of moving from the current state to the next state by visiting a given node.

Method parameters in org.ddolib.examples.tsp with type arguments of type TSPState

Modifier and Type	Method	Description
TSPState	TSPRelax.mergeStates(Iterator<TSPState> states)	Merges multiple TSPState instances into a single relaxed state.