title: Difference between Shortest Path and Djikstra's Algorithm and Travelling Salesman
body: <p>What is the difference between <code>Shortest Path</code> algorithm and <code>Djikstras Algorithm</code> and <code>Travelling Salesman</code>?
  As per what I know is in <code>Shortest Path</code> We do not travel through all the vertex with shortest path.
   In <code>Travelling Salesman Problem</code> we travel through all the vertices only once.
  and about <code>Djikstra's Algorithm</code> what I learnt is it is same as Travelling Salesmen. but the video tutorials (<a href="https://www.youtube.com/watch?v=KvRwplnIoEM" rel="nofollow">VIDEO</a>) says something different.</p>
  
  <p>Please Explain.</p>