edu.uci.ics.jung.algorithms.scoring

Class ClosenessCentrality<V,E>

java.lang.Object

edu.uci.ics.jung.algorithms.scoring.DistanceCentralityScorer<V,E>

edu.uci.ics.jung.algorithms.scoring.ClosenessCentrality<V,E>

All Implemented Interfaces:

VertexScorer<V,java.lang.Double>

public class ClosenessCentrality<V,E>
extends DistanceCentralityScorer<V,E>

Assigns scores to each vertex based on the mean distance to each other vertex.

Constructor Summary

Constructors

Constructor and Description
ClosenessCentrality(Hypergraph<V,E> graph) Creates an instance which measures distance on the graph without edge weights.
ClosenessCentrality(Hypergraph<V,E> graph, Distance<V> distance) Creates an instance using the specified vertex/vertex distance metric.
ClosenessCentrality(Hypergraph<V,E> graph, com.google.common.base.Function<E,? extends java.lang.Number> edge_weights) Creates an instance which measures distance using the specified edge weights.

Method Summary

Methods inherited from class edu.uci.ics.jung.algorithms.scoring.DistanceCentralityScorer

getVertexScore

Methods inherited from class java.lang.Object

equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

ClosenessCentrality

public ClosenessCentrality(Hypergraph<V,E> graph,
                           Distance<V> distance)

Creates an instance using the specified vertex/vertex distance metric.

Parameters:

graph - the input

distance - the vertex/vertex distance metric.

ClosenessCentrality

public ClosenessCentrality(Hypergraph<V,E> graph,
                           com.google.common.base.Function<E,? extends java.lang.Number> edge_weights)

Creates an instance which measures distance using the specified edge weights.

Parameters:

graph - the input graph

edge_weights - the edge weights to be used to determine vertex/vertex distances

ClosenessCentrality

public ClosenessCentrality(Hypergraph<V,E> graph)

Creates an instance which measures distance on the graph without edge weights.

Parameters:

graph - the graph whose vertices' centrality scores will be calculated