Add bipartite clustering coefficients

[Jordi Torrents]

Consider adding to igraph the computation of bipartite clustering coefficients as defined in pp 40-41 of Latapy et al (2008). Find attached a python implementation with some tests.

Matthieu Latapy, Clémence Magnien and Nathalie Del Vecchio. Basic Notions for the Analysis of Large Two-mode Networks. Social Networks 30 (1), p. 31-48, 2008
There is also a C implementation from the authors: http://www-rp.lip6.fr/~latapy/Bip/

The link above is broken, maybe the code is actually here: ftp://www-rp.lip6.fr/pub/latapy/Bip/

[Emmanuel N (enavarro222)]

Here is a simple python implementation of the "global" clustering coefficient described in the same paper, and before in (page 79):
Garry Robins, Malcolm Alexander. Small Worlds among Interlocking Directors: Network Structure and Distance in Bipartite Graphs. 2004. Computational & Mathematical Organization Theory, 10(1), 69–94.

[Emmanuel N (enavarro222)]

Just to say that I started to code the global bipartite transitivity in C (4 times number of square / number of path of length 3, the one I just posted a python version) + python wrapper.
I will propose a patch between tomorrow and Monday.

[Gábor Csárdi (gabor.csardi)]

Emmanuel, sounds great! Thanks!

[Emmanuel N (enavarro222)]

With a small delay (sorry for that), here is the patch !

It contains:
 * the function in bipartite.c
 * python wrapper
 * some small tests (examples/simple/igraph_bipartite_transitivity.c)

Certainly the doc need to be proofread...

[Gábor Csárdi (gabor.csardi)]

Thanks again! Will look at it soon.

[Gábor Csárdi (gabor.csardi)]

The development of igraph has moved to github, so please do not comment on this bug here. You are of course welcome to comment on github, here:
https://github.com/igraph/igraph/issues/344