|
From: | Giovanni Marco Dall'Olio |
Subject: | Re: [igraph] average path length for graphs containing multiple components |
Date: | Wed, 21 Nov 2012 15:02:55 +0100 |
> 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
[Prev in Thread] | Current Thread | [Next in Thread] |