Betweenness Centrality

Sébastien Heymann edited this page Mar 1, 2015 · 1 revision
Clone this wiki locally

Node Betweenness Centrality measures how often a node appears on shortest paths between nodes in the network.

Description

http://en.wikipedia.org/wiki/Betweenness#Betweenness_centrality

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

Additional Reading