Module org.jgrapht.core
Package org.jgrapht.alg.interfaces
Interface HamiltonianCycleAlgorithm<V,E>
-
- Type Parameters:
V- the graph vertex typeE- the graph edge type
- All Known Implementing Classes:
ChristofidesThreeHalvesApproxMetricTSP,FarthestInsertionHeuristicTSP,GreedyHeuristicTSP,HamiltonianCycleAlgorithmBase,HeldKarpTSP,NearestInsertionHeuristicTSP,NearestNeighborHeuristicTSP,PalmerHamiltonianCycle,RandomTourTSP,TwoApproxMetricTSP,TwoOptHeuristicTSP
public interface HamiltonianCycleAlgorithm<V,E>An algorithm 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).
- Author:
- Alexandru Valeanu
-
-
Method Summary
All Methods Instance Methods Abstract Methods Modifier and Type Method Description GraphPath<V,E>getTour(Graph<V,E> graph)Computes a tour.
-