NetworkX 计算聚类系数的Python实现
关于聚类系数的原汁原味的介绍，可以参考小世界网络这篇论文 [1]： The clustering coefficient C(p) is defined as follows. Suppose that a vertex v has kv neighbours; then at most kvkv 21=2 edges can exist between them (this occurs when every neighbourof v is connected to everyother neighbo...