networkx.clustering¶

clustering(G, nbunch=None, weights=False)¶

Compute the clustering coefficient for nodes.

For each node find the fraction of possible triangles that exist,

$c_v = \frac{2 T(v)}{deg(v)(deg(v)-1)}$

where $T(v)$ is the number of triangles through node $v$ .

Parameters:

G : graph

A networkx graph

nbunch : container of nodes, optional

Limit to specified nodes. Default is entire graph.

weights : bool, optional

If True return fraction of connected triples as dictionary

Returns:

out : float, dictionary or tuple of dictionaries

Clustering coefficient at specified nodes

Notes

The weights are the fraction of connected triples in the graph which include the keyed node. Ths is useful for computing transitivity.

Self loops are ignored.

Examples

>>> G=nx.complete_graph(5)
>>> print nx.clustering(G,0)
1.0
>>> print nx.clustering(G)
{0: 1.0, 1: 1.0, 2: 1.0, 3: 1.0, 4: 1.0}