Why is my A* Search algorithm for TSP slow to converge?

Question

I\'ve written an implementation of A* search for the TSP using the nearest neighbor heuristic. It is currently extremely slow to converge. I\'m not sure whether to spend tim