edu.ucla.sspace.graph

Class BetweennessCentrality

java.lang.Object

edu.ucla.sspace.graph.BetweennessCentrality

All Implemented Interfaces:

Serializable

public class BetweennessCentrality
extends Object
implements Serializable

An implementation of Brandes (2001) "A Faster Algorithm for Betweenness Centrality" (available here) for computing the betweenness centrality for all the vertices in a graph.

See Also:

Serialized Form

Constructor Summary

Constructors

Constructor and Description
BetweennessCentrality() Creates a new instance of a BetweennessCentrality

Method Summary

Methods

Modifier and Type	Method and Description
<E extends Edge> double[]	compute(Graph<E> g) Returns a mapping from each vertex to its betweenness centrality measure.

Methods inherited from class java.lang.Object

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

Constructor Detail

BetweennessCentrality

public BetweennessCentrality()

Creates a new instance of a BetweennessCentrality

Method Detail

compute

public <E extends Edge> double[] compute(Graph<E> g)

Returns a mapping from each vertex to its betweenness centrality measure.