[Boost-users] [BGL] saving all-pair shortest paths

Subject: [Boost-users] [BGL] saving all-pair shortest paths
From: Shyamendra Solanki (shyamendra_at_[hidden])
Date: 2009-10-09 02:23:27

Hi,

  I understand that both the floyd-warshall and johnson algorithms  populate
the DistanceMatrix for shortest distances between any pair of vertices.
  Could you give some hint how to get the actual shortest paths?

Thanks,
Shyam