robins_alexander_clustering(G)
Robins and Alexander defined bipartite clustering coefficient as four times the number of four cycles :None:None:`C_4` divided by the number of three paths :None:None:`L_3` in a bipartite graph:
a bipartite graph
The Robins and Alexander bipartite clustering for the input graph.
Compute the bipartite clustering of G.
>>> from networkx.algorithms import bipartiteSee :
... G = nx.davis_southern_women_graph()
... print(round(bipartite.robins_alexander_clustering(G), 3)) 0.468
The following pages refer to to this document either explicitly or contain code examples using this.
networkx.algorithms.bipartite.cluster.latapy_clustering
networkx.algorithms.bipartite.cluster.robins_alexander_clustering
Hover to see nodes names; edges to Self not shown, Caped at 50 nodes.
Using a canvas is more power efficient and can get hundred of nodes ; but does not allow hyperlinks; , arrows or text (beyond on hover)
SVG is more flexible but power hungry; and does not scale well to 50 + nodes.
All aboves nodes referred to, (or are referred from) current nodes; Edges from Self to other have been omitted (or all nodes would be connected to the central node "self" which is not useful). Nodes are colored by the library they belong to, and scaled with the number of references pointing them