title: Floyd-Warshall: all shortest paths
body: <p>I've implemented Floyd-Warshall to return the distance of the shortest path between every pair of nodes/vertices and a <strong>single</strong> shortest path between each of these pairs.</p>
  
  <p>Is there any way to get it to return every shortest path, even when there are multiple paths that are tied for shortest, for every pair of nodes?  (I just want to know if I'm wasting my time trying)</p>