Function ADS::tspGap

• Defined in File Approximation.h

Function Documentation

inline std::vector<std::vector<long>> ADS::tspGap(const Adjacency &G, long s)

the distances of Teorema 19.2: 1 on the edges of G, s n elsewhere; their optimum is n if G has a Hamiltonian circuit and more than s n otherwise

Pre:

G is unoriented, i.e., square and symmetric, and s >= 1

Post:

a symmetric matrix of the size of G