Bases: object
Class, which provides static functions for computing additional information for clustering coefficients.
A ClusteringCoefficient
object itself doesn’t have to be created.
Approximates the average local clustering coefficient.
G (networkit.Graph) – The input graph.
trials (int) – Number of runs. Higher values result in higher quality and larger running times.
Approximates the global clustering coefficient.
G (networkit.Graph) – The input graph.
trials (int) – Number of runs. Higher values result in higher quality and larger running times.
Calculates the global clustering coefficient.
G (networkit.Graph) – The input graph.
This calculates the average local clustering coefficient of graph G using inherently sequential triangle counting.
Notes
where
G (networkit.Graph) – The input graph.
Returns approximate average local clustering coefficient. The maximum error can be given as a parameter and determines the number of samples taken.
For details see: Schank, Wagner: Approximating Clustering Coefficient and Transitivity
G (networkit.Graph) – The input graph.
error (float) – Maximum allowed error. Default: 0.01