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