public class Metrics extends Object
Constructor and Description |
---|
Metrics() |
Modifier and Type | Method and Description |
---|---|
static <V,E> Map<V,Double> |
clusteringCoefficients(Graph<V,E> graph)
Returns a
Map of vertices to their clustering coefficients. |
public static <V,E> Map<V,Double> clusteringCoefficients(Graph<V,E> graph)
Map
of vertices to their clustering coefficients.
The clustering coefficient cc(v) of a vertex v is defined as follows:
degree(v) == {0,1}
: 0
degree(v) == n, n >= 2
: given S, the set of neighbors
of v
: cc(v) = (the sum over all w in S of the number of
other elements of w that are neighbors of w) / ((|S| * (|S| - 1) / 2).
Less formally, the fraction of v
's neighbors that are also
neighbors of each other.
Note: This algorithm treats its argument as an undirected graph; edge direction is ignored.
V
- the vertex typeE
- the edge typegraph
- the graph whose clustering coefficients are to be calculatedCopyright © 2015. All rights reserved.