Clustering Coefficient

The clustering coefficient is a measure of the degree to which nodes in a graph tend to cluster together. Evidence suggests that in most real-world networks, and in particular social networks, nodes tend to create tightly knit groups characterized by a relatively high density of ties. This algorithm is used to calculate the aggregation degree of nodes in a graph.

This algorithm is often used to measure the structure features of a graph.

None

The multi-edge situation is not considered.

Run the algorithm to calculate the clustering coefficient of a graph. The JSON result is displayed in the query result area.