Class BarycenterScorer<V,E>

java.lang.Object

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

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

All Implemented Interfaces:

VertexScorer<V,Double>

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

Assigns scores to each vertex according to the sum of its distances to all other vertices.

Field Summary

Fields inherited from class DistanceCentralityScorer

averaging, distance, graph, ignore_missing, ignore_self_distances, output

Constructor Summary

Constructors

Constructor	Description
BarycenterScorer(Hypergraph<V,E> graph)	Creates an instance with the specified graph.
BarycenterScorer(Hypergraph<V,E> graph, com.google.common.base.Function<E, ? extends Number> edge_weights)	Creates an instance with the specified graph and edge weights.
BarycenterScorer(Hypergraph<V,E> graph, Distance<V> distance)	Creates an instance with the specified graph and distance metric.

Method Summary

Methods inherited from class DistanceCentralityScorer

getVertexScore

Methods inherited from class Object

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

Constructor Details

BarycenterScorer

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

Creates an instance with the specified graph and distance metric.

Parameters:

graph - the input graph

distance - the distance metric to use

BarycenterScorer

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

Creates an instance with the specified graph and edge weights. Will generate a Distance metric internally based on the edge weights.

Parameters:

graph - the input graph

edge_weights - the edge weights to use to calculate vertex/vertex distances

BarycenterScorer

public BarycenterScorer(Hypergraph<V,E> graph)

Creates an instance with the specified graph. Will generate a Distance metric internally assuming that the graph is unweighted.

Parameters:

graph - the input graph