Algorithms to characterize the number of triangles in a graph.
| triangles(G[, nbunch]) | Compute the number of triangles. |
| transitivity(G) | Compute transitivity. |
| clustering(G[, nbunch, weights]) | Compute the clustering coefficient for nodes. |
| average_clustering(G) | Compute average clustering coefficient. |