title: Hamiltonian Path vs Shortest Path
body: <p>After researching about both problems, I can't conclude what is the difference amongst them.</p>
  
  <p><strong>Hamiltonian Path</strong></p>
  
  <p>A Hamiltonian path is a path between two vertices of a graph that visits each vertex exactly once. Given a graph <code>G</code> and two distinct nodes <code>S</code> and <code>E</code>, is there a Hamiltonian path in <code>G</code> from <code>S</code> to <code>E</code>?</p>
  
  <p>I've found that this problem is NP-Complete</p>
  
  <p><strong>Shortest Path</strong></p>
  
  <p>In graph theory, the shortest path problem is the problem of finding a path between two vertices (or nodes) in a graph such that the sum of the weights of its constituent edges is minimized.
  This problem is P</p>
  
  <p>What is the actual difference between them? And how is their complexity calculated?</p>