Package org.jgrapht.alg.interfaces
Interface HamiltonianCycleImprovementAlgorithm<V,E>
-
- Type Parameters:
V
- the graph vertex typeE
- the graph edge type
- All Known Implementing Classes:
TwoOptHeuristicTSP
public interface HamiltonianCycleImprovementAlgorithm<V,E>
An algorithm improving the result of solving the Hamiltonian cycle problem.A Hamiltonian cycle, also called a Hamiltonian circuit, Hamilton cycle, or Hamilton circuit, is a graph cycle (i.e., closed loop) through a graph that visits each node exactly once (Skiena 1990, p. 196). An improvement algorithm could be one that optimises the cycle for lower cost, or that updates the cycle to match changes in the graph.
- Author:
- Alexandru Valeanu, Peter Harman
-
-
Method Summary
All Methods Instance Methods Abstract Methods Modifier and Type Method Description GraphPath<V,E>
improveTour(GraphPath<V,E> tour)
Improves a tour.
-