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.DistanceCentralityScorer<V,E>
       edu.uci.ics.jung.algorithms.scoring.ClosenessCentrality<V,E>
edu.uci.ics.jung.algorithms.scoring.ClosenessCentrality<V,E>
- All Implemented Interfaces: 
- VertexScorer<V,Double>
- public class ClosenessCentrality<V,E> 
- extends DistanceCentralityScorer<V,E>
Assigns scores to each vertex based on the mean distance to each other vertex.
- Author:
- Joshua O'Madadhain
 
 
 
 
 
| Methods inherited from class java.lang.Object | 
| clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait | 
 
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,
                           org.apache.commons.collections15.Transformer<E,? extends 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-
 
Copyright © 2009. All Rights Reserved.