Class TravelingSalesman

All Implemented Interfaces:
Serializable, Cloneable, Iterable<OptProbElement>, Collection<OptProbElement>, Set<OptProbElement>

public class TravelingSalesman extends CombinatoricsProblem
implements the traveling salesman problem. Every element has an x- coordinate and a y- coordinate. Every city can be connected to each other and the distance is the cartesian distance bewteen them. Therefore the graph is fully connected.
Sebastian Franke
See Also: