Re: [igraph] Re: All possible shortest path between two vertices

[Tim Chen]

One intuitive way is to perform a BFS and prune all the branches
longer than the shortest path.

Here is a sample code

http://stackoverflow.com/questions/713508/find-the-paths-between-two-given-nodes

HiH,
Tim

On Fri, Mar 26, 2010 at 6:13 AM, Tamas Nepusz <address@hidden> wrote:
>> This is also the feature I have been waiting for!
> The latest nightlies of the R and Python interface contain a to=... argument 
> for get.all.shortest.paths (in R) and Graph.get_all_shortest_paths (in 
> Python), I have just checked it.
>
> --
> Tamas
>
>
>
> _______________________________________________
> igraph-help mailing list
> address@hidden
> http://lists.nongnu.org/mailman/listinfo/igraph-help
>