Class BarycenterScorer<V,​E>

  • All Implemented Interfaces:
    VertexScorer<V,​java.lang.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.
    • Constructor Summary

      Constructors 
      Constructor Description
      BarycenterScorer​(edu.uci.ics.jung.graph.Hypergraph<V,​E> graph)
      Creates an instance with the specified graph.
      BarycenterScorer​(edu.uci.ics.jung.graph.Hypergraph<V,​E> graph, Distance<V> distance)
      Creates an instance with the specified graph and distance metric.
      BarycenterScorer​(edu.uci.ics.jung.graph.Hypergraph<V,​E> graph, org.apache.commons.collections4.Transformer<E,​? extends java.lang.Number> edge_weights)
      Creates an instance with the specified graph and edge weights.
    • Method Summary

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
    • Constructor Detail

      • BarycenterScorer

        public BarycenterScorer​(edu.uci.ics.jung.graph.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​(edu.uci.ics.jung.graph.Hypergraph<V,​E> graph,
                                org.apache.commons.collections4.Transformer<E,​? extends java.lang.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​(edu.uci.ics.jung.graph.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