Compute average clustering coefficient.
A clustering coefficient for the whole graph is the average,
where is the number of nodes in .
Parameters : | G : graph
weighted : bool, optional
|
---|---|
Returns : | out : float
|
Notes
This is a space saving routine; it might be faster to use clustering to get a list and then take the average.
Self loops are ignored.
References
[R102] | Generalizations of the clustering coefficient to weighted complex networks by J. Saramäki, M. Kivelä, J.-P. Onnela, K. Kaski, and J. Kertész, Physical Review E, 75 027105 (2007). http://jponnela.com/web_documents/a9.pdf |
Examples
>>> G=nx.complete_graph(5)
>>> print(nx.average_clustering(G))
1.0