[graph-tool] strength and clustering coefficient on weighted digraph
Tiago de Paula Peixoto
tiago at skewed.de
Tue Mar 5 20:52:54 CET 2013
On 03/05/2013 08:38 PM, Tiago de Paula Peixoto wrote:
> Hi Abdo,
> On 03/02/2013 04:13 AM, Alexandre Hannud Abdo wrote:
>> If the degrees won't change during your processing, you might want to
>> store them in a property map for efficiency, instead of recalculating
>> them whenever you need the value.
> Just a small note: Getting the degrees is a constant operation, except
> for filtered graphs where it O(k). So unless you are using a filtered
> graph, there should be no efficiency difference.
I just realized you were referring to the weighted degrees, so nevermind.
Tiago de Paula Peixoto <tiago at skewed.de>
-------------- next part --------------
A non-text attachment was scrubbed...
Size: 555 bytes
Desc: OpenPGP digital signature
More information about the graph-tool