title: Dijkstra’s shortest-path algorithm what if there are paths with same distance?
body: <p><img src="https://i.stack.imgur.com/90Qwu.png" alt="enter image description here"></p>
  
  <p>In this network Dijkstra’s shortest-path algorithm is used. 
  The question is which path will A use to reach D because both are equal? </p>
  
  <p><img src="https://i.stack.imgur.com/T1HDF.png" alt="enter image description here"></p>
  
  <p>is that table missing?</p>