Re: [igraph] average path length for graphs containing multiple components

[Giovanni Marco Dall'Olio]

Thank you again... I am quite new to igraph, and I didn't see the shortest_paths function.
Gio

On Wed, Nov 21, 2012 at 2:44 PM, Tamás Nepusz <address@hidden> wrote:

> It's nice to know that the function "get_shortest_paths" support weights. So, the formula should be something like the following:

Basically yes, but it would probably be more scalable to calculate the path lengths for the vertices one by one (in g.shortest_paths) because this way you don't have to store the entire shortest path matrix in memory.

Best,
Tamas

--
Giovanni Dall'Olio, phd student
IBE, Institut de Biologia Evolutiva, CEXS-UPF (Barcelona, Spain)

My blog on bioinformatics: http://bioinfoblog.it