V- the graph vertex type
E- the graph edge type
public interface HamiltonianCycleAlgorithm<V,E>
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).
|Modifier and Type||Method and Description|
Computes a tour.
Copyright © 2019. All rights reserved.