- Type Parameters:
V- the graph vertex type
E- the graph edge type
- All Known Implementing Classes:
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).
- Alexandru Valeanu