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

[Tamas Nepusz]

Dear AJ,

This function is on our TODO list and it may be included in igraph 0.6.
The current stable version contains no such function at the moment. If
you wish, you can track the progress of this feature in the
corresponding bug report:

https://bugs.launchpad.net/igraph/+bug/372740

Currently what you can do is to find all shortest paths from a single
node to all others (see get.all.shortest.paths in the documentation).
This is overkill if you need all the shortest paths between vertices V1
and V2 only, but if your network is small, then this might work.

Also, please consider subscribing to the igraph-help mailing list
(address@hidden) if you are asking questions. Someone else on
the mailing list might be faster in replying to a question than me :)

-- 
Tamas

On Thu, Mar 25, 2010 at 03:24:36PM +0000, A Venkatakrishnan wrote:
> Dear Tamas,
> 
> I am AJ, a PhD student in Bioinformatics. I am working with graphs and I have 
> been using the R 'igraph' library for my analyses. I came across your email 
> address on the igraph forum where you had answered a question regarding 
> shortest paths. 
> 
> Presently, one of my analyses requires me to compute all possible shortest 
> paths (list of vertices) between a given pair of vertices of a graph. The 
> function get.shortest.paths() returns only one shortest path between a pair 
> of vertices, although more than one could exist between them. I was wondering 
> if there is a way to compute all possible shortest paths. I would be very 
> grateful if you could give me suggestions to solve the above-mentioned 
> problem.
> 
> Thank you very much for your time.
> 
> Best,
> AJ