Re: [igraph] Distance()

[Tamas Nepusz]

Hi Marco,

> If not, which way should i take? get_all_shortest_path doesn't let me
> decide the endvertex of the path, and bfsiter iters thru all vertices
> too.
Start with bfsiter() then simply break the iteration when you found  
your desired vertex. That's what any other uninformed shortest path  
algorithm would do anyway:

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

--
T.