1 | initial version |

You can easily find the list of all predecessors : just call the "distance_all_pairs" method, and you can then get all predecessors of x in a shortest `u-v`

path as the list of all neighbors `p`

of `x`

such that `d(u,p)+1+d(x,v)`

.

Nathann

2 | No.2 Revision |

You can easily find the list of all predecessors : just call the "distance_all_pairs" method, and you can then get all predecessors of x in a shortest `u-v`

path as the list of all neighbors `p`

of `x`

such that

.~~d(u,p)+1+d(x,v)~~d(u,p)+1+d(x,v)=d(u,v)

Nathann

Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.