
15 Apr
2011
15 Apr
'11
2:25 p.m.
Hi again I've noticed that the all-pairs SP algorithms (eg: Johnson, Floyd-Marshall) only "return" a distance matrix that hold the shortest distances between any node n and n'. Is there a way to determine the actual path (eg: n2-n4-n5-n1-n0) between these nodes using the all-pairs algorithms? Chris