title: Find a Hamiltonian cycle of no more than twice the minimum cost in O(m+n log n) in an undirected graph with costs satisfying the triangle inequality
body: <p>So I've been given this task and I do not know how to use the information regarding the costs. This is the requirement and I have no additional information.</p>