Warning

This documents an unmaintained version of NetworkX. Please upgrade to a maintained version and see the current NetworkX documentation.

Clustering

Algorithms to characterize the number of triangles in a graph.

triangles(G[, nodes])	Compute the number of triangles.
transitivity(G)	Compute graph transitivity, the fraction of all possible triangles present in G.
clustering(G[, nodes, weight])	Compute the clustering coefficient for nodes.
average_clustering(G[, nodes, weight, …])	Compute the average clustering coefficient for the graph G.
square_clustering(G[, nodes])	Compute the squares clustering coefficient for nodes.