Re: [igraph] clustering coefficients for bipartite networks

[Simone Gabbriellini]

Hi Tamas,

I have come to this solution but I don't know if I can consider it a fast one:

    def CCBN(self):
        for u in self.g.vs(type=0):
            ccdot = []
            for v in g.vs(type=0):
                unei = g.neighbors(u)
                vnei = g.neighbors(v)
                if len(set(unei) & set(vnei)) > 0:
                    ccdot.append(len(set(unei) & set(vnei)) / len(list(set(unei 
+ vnei))))
            u['ccdot'] = [float(sum(ccdot)) / len(ccdot) if len(ccdot) > 0 else 
0] 
        for u in g.vs(type=1):
            ccdot = []
            for v in g.vs(type=0):
                unei = g.neighbors(u)
                vnei = g.neighbors(v)
                if len(set(unei) & set(vnei)) > 0:
                    ccdot.append(len(set(unei) & set(vnei)) / len(list(set(unei 
+ vnei))))
            u['ccdot'] = [float(sum(ccdot)) / len(ccdot) if len(ccdot) > 0 else 
0] 

what do you think?

best,
Simone