public class Metrics
extends java.lang.Object
| Constructor and Description |
|---|
Metrics() |
| Modifier and Type | Method and Description |
|---|---|
static <V,E> java.util.Map<V,java.lang.Double> |
clusteringCoefficients(edu.uci.ics.jung.graph.Graph<V,E> graph)
Returns a
Map of vertices to their clustering coefficients. |
public static <V,E> java.util.Map<V,java.lang.Double> clusteringCoefficients(edu.uci.ics.jung.graph.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.
graph - the graph whose clustering coefficients are to be calculated