This documents an unmaintained version of NetworkX. Please upgrade to a maintained version and see the current NetworkX documentation.
Algorithms to characterize the number of triangles in a graph.
||Compute the number of triangles.|
||Compute graph transitivity, the fraction of all possible triangles present in G.|
||Compute the clustering coefficient for nodes.|
||Compute the average clustering coefficient for the graph G.|
||Compute the squares clustering coefficient for nodes.|