This is the algorithm of Hamiltonian Cycle of minimum cost in an oriented graph made by me in c++. This is the most optimized method I have been using in competitions. I've been using memoisation with Byte Masks.