[Top][All Lists]

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
## Re: [igraph] Fwd: How to get length of the shortest path between two ver

**From**: |
Tamas Nepusz |

**Subject**: |
Re: [igraph] Fwd: How to get length of the shortest path between two vertices |

**Date**: |
Mon, 11 Jul 2011 12:38:48 +0200 |

**User-agent**: |
Mozilla/5.0 (X11; U; Linux x86_64; en-US; rv:1.9.2.17) Gecko/20110516 Lightning/1.0b2 Thunderbird/3.1.10 |

>* Yes, the "shortest.paths()" returns the*
>* length of shortest path only, but you can't specify the "from" and "to" *
>* vertices. Actually my question should be:*
>* How can I get the lengths of the shorest paths between the specified "from" *
>* and "to" vertices.*
Either use get.shortest.paths() and then extract the paths from the result
which end in "to", and take their lengths, or try to upgrade to the
development version of igraph (nighly builds are here:
http://code.google.com/p/igraph). The development version already includes a
"to" parameter for shortest.paths().
--
T.