title: How does Dijkstra's Algorithm find shortest path?
body: <p><img src="https://i.stack.imgur.com/MN3lL.png" alt="Example"></p>
  
  <p>How can the shortest path be A,C,E,B,D when there is no path between E and B?</p>