title: What shall be the optimal algorithm for going from source to to all vertices such that no vertex is visited twice?
body: <p>Suppose you (let's say, A) and your colleagues(B and C) are to be picked up by a van from your office(O), which drops you guys to your respective homes. The distance from O to A (and vice-versa), O to B (and vice-versa), O to C (and vice-versa), A to B (and vice-versa), B to C (and vice-versa), and C to A (and vice-versa) is known. How will you calculate the shortest route taken by the van driver to drop all of you?</p>
  <p>NOTE: Keep in mind that is not necessary that the distance from A to B and B to A is equal.</p>