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