title: Shortest path that visits all vertices in a directed complete weighted graph
body: <p>Given: complete directed weighted graph. All weights are positive. Is there any simple way (heuristics?) to find the shortest (in terms of weights) path that visits all vertices? Number of vertices is around 25.
  This problem seems to be close to Asymmetric Travelling Salesman, but I don't require this path to be the cycle.</p>