title: Find the shortest Path between two nodes (vertices)
body: <p>I have a list of interconnected edges (<code>E</code>), how can I find the shortest path connecting from one vertex to another?</p>
  
  <p>I am thinking about using <a href="http://www.topcoder.com/tc?module=Static&amp;d1=tutorials&amp;d2=lowestCommonAncestor" rel="nofollow noreferrer">lowest common ancestors</a>, but the edges don't have a clearly defined root, so I don't think the solution works. </p>
  
  <p>Shortest path is defined by the minimum number of vertexes traversed.</p>
  
  <p><del><strong>Note: There could be a multi-path connecting two vertices, so obviously breadth first search won't work</strong></del></p>