Following pseudo-code from:
Ulrik Brandes. 2001. A faster algorithm for betweenness centrality.
Journal of Mathematical Sociology 25(2):163-177, (2001).
Nested Class Summary
Modifier and Type
Class and Description
An entry of the number of remaining branch vertices versus
the set of branches (each as a
Constructor and Description
Methods inherited from class java.lang.
Object clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
public static final <T>
ArrayList< Vertex<T>> safeCompute( Collection< Vertex<T>> vs)
Like @see compute, but operates on a copy of all Vertex instances,
and return a Collection with the same order as @param vs.
public static final <T> void compute(
Collection< Vertex<T>> vs)
Computes betweenness centrality of each vertex in the collection of vertices @param vs
where all vertices are part of the same graph.
Assumes the internal variables of each Vertex are reset to its initialization values,
and that the neighbors array is proper as well.
When done, the centrality of each Vertex is set in the homonymous Vertex field.
Copyright © 2015–2017 Fiji. All rights reserved.