title: Shortest path visiting set of vertices in an un directed graph
body: <p>I have an undirected graph of locations in an indoor map. 
  When given a set of vertices , i want to find the shortest path which will cover all those vertices.
  Graph contains 52 vertices and 150 - 250 Edges.</p>
  
  <p>What is the best algorithm i can use to find the shortest path.
  Please don't get confused that this is a Travelling Salesman Problem. It doesn't have to cover all the nodes.Only the given set of nodes.</p>