Python/Java implementations of solution for NP-complete problems: TSP, Shortest Hamiltonian Path.  Implementation uses nearest neighbor with randomized k-opts.