/*
* Created on Jul 12, 2007
*
* Copyright (c) 2007, The JUNG Authors
*
* All rights reserved.
*
* This software is open-source under the BSD license; see either
* "license.txt" or
* https://github.com/jrtom/jung/blob/master/LICENSE for a description.
*/
package edu.uci.ics.jung.algorithms.scoring;
import com.google.common.base.Function;
import edu.uci.ics.jung.algorithms.shortestpath.Distance;
import edu.uci.ics.jung.graph.Hypergraph;
/**
* Assigns scores to each vertex based on the mean distance to each other vertex.
*
* @author Joshua O'Madadhain
*/
public class ClosenessCentrality extends DistanceCentralityScorer
{
/**
* Creates an instance using the specified vertex/vertex distance metric.
* @param graph the input
* @param distance the vertex/vertex distance metric.
*/
public ClosenessCentrality(Hypergraph graph, Distance distance)
{
super(graph, distance, true);
}
/**
* Creates an instance which measures distance using the specified edge weights.
* @param graph the input graph
* @param edge_weights the edge weights to be used to determine vertex/vertex distances
*/
public ClosenessCentrality(Hypergraph graph, Function edge_weights)
{
super(graph, edge_weights, true);
}
/**
* Creates an instance which measures distance on the graph without edge weights.
* @param graph the graph whose vertices' centrality scores will be calculated
*/
public ClosenessCentrality(Hypergraph graph)
{
super(graph, true);
}
}
Ads help maintain this website.