networkx.algorithms.cluster.average_clustering¶

networkx.algorithms.cluster.average_clustering(G)¶

Compute average clustering coefficient.

A clustering coefficient for the whole graph is the average,

$C = \frac{1}{n}\sum_{v \in G} c_v,$

where $n$ is the number of nodes in $G$ .

Parameters :

G : graph

A networkx graph

Returns :

out : float

Average clustering

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.

Examples

>>> G=nx.complete_graph(5)
>>> print(nx.average_clustering(G))
1.0