title: The best shortest path algorithm
body: <p>What is the difference between the <strong>"Floyd-Warshall algorithm"</strong> and <strong>"Dijkstra's Algorithm"</strong>, and which is the best for finding the shortest path in a graph?</p>
  
  <p>I need to calculate the shortest path between all the pairs in a net and save the results to an array as follows:</p>
  
  <pre><code>**A     B     C     D      E**
  A 0     10    15    5     20
  B 10     0    5     5     10
  C 15     5    0     10    15
  D 5      5    10    0     15
  E 20     10    15   15    0
  </code></pre>