title: How to determine the path between 2 nodes, given the shortest distance matrix between the nodes?
body: <p>How to determine the shortest path between 2 nodes, given the shortest distance matrix between the nodes of a graph?</p>
  
  <p>For example, I have 4 nodes and the shortest distance matrix(m).</p>
  
  <pre><code>0 4 5 8
  4 0 6 3
  5 6 0 2
  8 3 2 0
  </code></pre>
  
  <p>m(i,j) is the distance of the path between node i and node j, it need not be edge between node i and node j. </p>
  
  <p>Could someone guide on how this can be done? Thank you in advance.</p>