Re: [igraph] Distance()

[Marco]

On Wed, Dec 3, 2008 at 12:59 PM, Tamas Nepusz <address@hidden> wrote:

> def distance(g, v1, v2):
>  for vertex, distance, _ in g.bfsiter(v1, advanced=True):
>    if vertex.index == v2:
>      return distance

Tamas,

I am sorry for my ignorance, but this assures me this is the minimum
length path between v1 and v2?
I'd say yes, but one never knows... :)

thanks,

marco