Re: [igraph] clustering coefficient in bipartite network

[Simone Gabbriellini]

I will for sure in the next week!

btw, the ccBip function you wrote can accomplish also other two clustering 
proposed by Latapy simply by using:

f <- function(un, vn) min(length(un), length(vn))

and

f <- function(un, vn) max(length(un), length(vn))

in place of:

f <- function(un, vn) length(union(un, vn))

maybe there is a way to insert this automatically inside the ccBip function, 
just to save computation time? 
the ideal output, at least to me, would be a list with the three measures, for 
each of which you have $proj1 and $proj2 

best,
simone

Il giorno 27/nov/2010, alle ore 19.41, Gábor Csárdi ha scritto:

> On Sat, Nov 27, 2010 at 3:29 PM, Simone Gabbriellini
> <address@hidden> wrote:
> [...]
>> I have almost found all the measures for bipartite networks proposed by 
>> Latapy, can send my script if you think it would be of some interest for the 
>> community...
> [...]
> 
> Simone,
> 
> if you have some minutes and you want to share the code, then you can
> put it in the igraph wiki, see http://igraph.sf.net -> Wiki. Thanks a
> lot!
> 
> G.
> 
> -- 
> Gabor Csardi <address@hidden>     UNIL DGM
> 
> _______________________________________________
> igraph-help mailing list
> address@hidden
> http://lists.nongnu.org/mailman/listinfo/igraph-help