pairs_shortest_paths(Graph&amp; g, DistanceMatrix&amp; D,
  const bgl_named_params&lt;P, T, R&gt;&amp; params = <i>all defaults</i>)

<i>// non-named parameter version</i>
template &lt;typename Graph, typename DistanceMatrix,
          typename VertexIndex, typename WeightMap, typename DT&gt;
bool
johnson_all_pairs_shortest_paths(VertexAndEdgeListGraph&amp; g1, 
  DistanceMatrix&amp; D,
  VertexIndex id1, Weight w1, DT zero)
</PRE>

<P>
This algorithm finds the shortest distance between every pair of
vertic