Uses of Class
org.cicirello.search.problems.tsp.BaseTSP

Packages that use BaseTSP

Package	Description
org.cicirello.search.problems.tsp	Classes and interfaces related to the Traveling Salesperson Problem (TSP).

Uses of BaseTSP in org.cicirello.search.problems.tsp

Subclasses of BaseTSP in org.cicirello.search.problems.tsp

Modifier and Type	Class	Description
class	RandomTSPMatrix	This class and its nested classes implement the Traveling Salesperson Problem (TSP), and its variant, the Asymmetric Traveling Salesperson Problem (ATSP), by generating a random distance matrix.
static final class	RandomTSPMatrix.Double	This class implements the Traveling Salesperson Problem (TSP), and its variant, the Asymmetric Traveling Salesperson Problem (ATSP), by generating a random distance matrix, with floating-point cost edges.
static final class	RandomTSPMatrix.Integer	This class implements the Traveling Salesperson Problem (TSP), and its variant, the Asymmetric Traveling Salesperson Problem (ATSP), by generating a random distance matrix, with integer cost edges.
class	TSP	This class and its nested classes implement the Traveling Salesperson Problem (TSP), such that cities are 2D points, and edge costs is the distance between them.
static final class	TSP.Double	Cost function for the Traveling Salesperson Problem (TSP), where edge costs are floating-point valued.
static final class	TSP.DoubleMatrix	Cost function for the Traveling Salesperson Problem (TSP), where edge costs are floating-point valued, and where all edge costs between pairs of cities are precomputed.
static final class	TSP.Integer	Cost function for the Traveling Salesperson Problem (TSP), where edge costs are integer valued.
static final class	TSP.IntegerMatrix	Cost function for the Traveling Salesperson Problem (TSP), where edge costs are integer valued, and where all edge costs between pairs of cities are precomputed.

Constructors in org.cicirello.search.problems.tsp with parameters of type BaseTSP

Modifier	Constructor	Description
	NearestCityHeuristic(BaseTSP problem)	Constructs a nearest city heuristic for an instance of the TSP.
	NearestCityPairHeuristic(BaseTSP problem)	Constructs a nearest city pair heuristic for an instance of the TSP.