[igraph] shortest path between two vertices

[Rajarshi Guha]

Hi, I'm using the Python igraph API and am trying to get the shortest path between two vertices. In general I will have multiple end vertices and a single start vertex. However I can't seem to find anything in Python API that lets me do this. I do see in the Ruby API that there is afunction that lets me do this:

http://igraph.rubyforge.org/igraph/classes/IGraph/ShortestPaths.src/M000108.html

Could somebody point me to the equivalent Python method.

Thanks,
-- 
Rajarshi Guha