title: Algorithm: shortest travelling route between 10 cities
body: <p>I have a graph with 80 cities. I need to find a shortest possible route passing through 10 cities.</p>
  
  <p>I have to start from a city that already defined as starting city and user will enter 10 city names from the city list. I must travel this 10 cities and than I have to go back to the city where I started. I just have all the information about road distances between the cities that are adjacent.I haven't any information except that.</p>
  
  <p>I know that Dijkstra, etc. found the shortest path between 2 cities and some heuristic algorithms need more data than that.</p>
  
  <p>Can I use Dijkstra for the shortest path between starting city and other 10 cities and then find a min spanning tree of that and traverse on it? Is there any heuristic algorithm that I can use with this data?</p>