Betweenness Centrality
From Gephi:Wiki
Betweenness Centrality

Node Betweenness Centrality measures how often a node appears on shortest paths between nodes in the network.
Objective
Description
From Wikipedia
Source code
See org.gephi.statistics.plugin.GraphDistance.java
.
Acknowledgments
This code was implemented by Patrick McSweeney.
Implemented Algorithm
Ulrik Brandes (2001). A faster algorithm for betweenness centrality PDF