[igraph] Re: average path length in bipartite networks

[Simone Gabbriellini]

Hello again,

> I tried shortest.path() but I cannot set as v= and to= the same set of nodes, 
> because this is not allowed. 

my bad, I was messing with the code, I can get the shortest paths of one set of 
nodes with:

shortest.paths(g, v=V(g)[type==TRUE], to=V(g)[type==TRUE], mode = "in")

all I need then is just an average, right?

thanks,
simone