[igraph] All possible shortest paths between two vertices

[A Venkatakrishnan]

Hi,

I am presently working with a graph and I need to compute all possible shortest 
paths (list of vertices) between two given vertices of the graph. The igraph 
function 'get.shortest.paths()' computes only one shortest path between two 
vertices, although more than one might exist between them. I would greatly 
appreciate if I could get some suggestions to get around solving the above 
mentioned problem.

Thanks,
AJ